scientific article; zbMATH DE number 3843497
zbMATH Open0531.90067MaRDI QIDQ3313622FDOQ3313622
Authors: Michel Minoux
Publication date: 1984
Title of this publication is not available (Why is that?)
Recommendations
global convergencesubgradient optimizationimplementationBenders' decompositioninitializationstarting solutionsComputational experiencelarge scale linear programsblock-diagonal structurecoupling variablesmulticommodity network synthesis
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cited In (8)
- Scalable parallel Benders decomposition for stochastic linear programming
- The Benders decomposition algorithm: a literature review
- Exact solution of multicommodity network optimization problems with general step cost functions
- A demand-shifting feasibility algorithm for Benders decomposition.
- On using approximations of the Benders master problem
- A hybrid approach of bundle and Benders applied large mixed linear integer problem
- Logic-based Benders decomposition for large-scale optimization
- Benders decomposition with adaptive oracles for large scale optimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3313622)