A demand-shifting feasibility algorithm for Benders decomposition.
From MaRDI portal
Publication:1812005
DOI10.1016/S0377-2217(02)00405-8zbMATH Open1035.90044OpenAlexW2028250228MaRDI QIDQ1812005FDOQ1812005
Authors: Peiling Wu, Joseph C. Hartman, George R. Wilson 
Publication date: 18 June 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00405-8
Recommendations
- Accelerating the Benders decomposition method: application to stochastic network design problems
- Accelerating Benders decomposition: multiple cuts via multiple solutions
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- The Benders decomposition algorithm: a literature review
- Benders decomposition for large-scale uncapacitated hub location
Cites Work
- Network flows. Theory, algorithms, and applications.
- Partitioning procedures for solving mixed-variables programming problems
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Multicommodity Distribution System Design by Benders Decomposition
- Introduction to Stochastic Programming
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- On using approximations of the Benders master problem
- A Benders decomposition based heuristic for the hierarchical production planning problem
- A Model for Fleet Sizing and Vehicle Allocation
- Title not available (Why is that?)
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- Title not available (Why is that?)
Cited In (3)
Uses Software
This page was built for publication: A demand-shifting feasibility algorithm for Benders decomposition.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1812005)
