Partitioning procedures for solving mixed-variables programming problems. Reprint

From MaRDI portal
Publication:2386645

DOI10.1007/s10287-004-0020-yzbMath1115.90361OpenAlexW1975387421MaRDI QIDQ2386645

J. F. Benders

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




Related Items (20)

Stochastic RWA and Lightpath Rerouting in WDM NetworksDynamic pooled capacity deployment for urban parcel logisticsPartitioning procedure for polynomial optimizationA bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehiclesMixed convexity and optimization results for an \((S-1,S)\) inventory model under a time limit on backordersScenario-dominance to multi-stage stochastic lot-sizing and knapsack problemsDesigning a portfolio-based closed-loop supply chain network for dairy products with a financial approach: accelerated benders decomposition algorithmRecent advances in optimization techniques for statistical tabular data protectionStochastic optimization for power system configuration with renewable energy in remote areasA cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point methodComputational study of the GDPO dual phase-1 algorithmA heuristic block coordinate descent approach for controlled tabular adjustmentDesigning a two-echelon distribution network under demand uncertaintyDecomposition-based method for sparse semidefinite relaxations of polynomial optimization problemsDesign of a distribution network using primal-dual decompositionThe maximum diversity assortment selection problemStage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programsRobust optimization in power systems: a tutorial overviewUnnamed ItemCombining 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