Partitioning procedures for solving mixed-variables programming problems. Reprint

DOI10.1007/S10287-004-0020-YzbMATH Open1115.90361OpenAlexW1975387421MaRDI QIDQ2386645FDOQ2386645

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

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)

Cited In (20)

• Mixed convexity and optimization results for an \((S-1,S)\) inventory model under a time limit on backorders
• Robust optimization in power systems: a tutorial overview
• Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming
• Design of a distribution network using primal-dual decomposition
• Computational study of the GDPO dual phase-1 algorithm
• Stochastic optimization for power system configuration with renewable energy in remote areas
• Designing a portfolio-based closed-loop supply chain network for dairy products with a financial approach: accelerated benders decomposition algorithm
• Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems
• Partitioning procedure for polynomial optimization
• Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs
• Designing a two-echelon distribution network under demand uncertainty
• The maximum diversity assortment selection problem
• Recent advances in optimization techniques for statistical tabular data protection
• Dynamic pooled capacity deployment for urban parcel logistics
• A heuristic block coordinate descent approach for controlled tabular adjustment
• A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles
• Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems
• Stochastic RWA and Lightpath Rerouting in WDM Networks
• Title not available (Why is that?)
• A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method

This page was built for publication: Partitioning procedures for solving mixed-variables programming problems. Reprint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2386645)