Partitioning procedures for solving mixed-variables programming problems. Reprint
From MaRDI portal
Publication:2386645
DOI10.1007/s10287-004-0020-yzbMath1115.90361OpenAlexW1975387421MaRDI QIDQ2386645
Publication date: 25 August 2005
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10287-004-0020-y
Large-scale problems in mathematical programming (90C06) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (20)
Stochastic RWA and Lightpath Rerouting in WDM Networks ⋮ Dynamic pooled capacity deployment for urban parcel logistics ⋮ Partitioning procedure for polynomial optimization ⋮ A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles ⋮ Mixed convexity and optimization results for an \((S-1,S)\) inventory model under a time limit on backorders ⋮ Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems ⋮ Designing a portfolio-based closed-loop supply chain network for dairy products with a financial approach: accelerated benders decomposition algorithm ⋮ Recent advances in optimization techniques for statistical tabular data protection ⋮ Stochastic optimization for power system configuration with renewable energy in remote areas ⋮ A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method ⋮ Computational study of the GDPO dual phase-1 algorithm ⋮ A heuristic block coordinate descent approach for controlled tabular adjustment ⋮ Designing a two-echelon distribution network under demand uncertainty ⋮ Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems ⋮ Design of a distribution network using primal-dual decomposition ⋮ The maximum diversity assortment selection problem ⋮ Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs ⋮ Robust optimization in power systems: a tutorial overview ⋮ Unnamed Item ⋮ Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming
This page was built for publication: Partitioning procedures for solving mixed-variables programming problems. Reprint
