Decomposition and Dynamic Cut Generation in Integer Linear Programming
- 10 August 2005
- journal article
- research article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 106 (2), 261-285
- https://doi.org/10.1007/s10107-005-0606-3
Abstract
No abstract availableKeywords
This publication has 44 references indexed in Scilit:
- Non Delayed Relax-and-Cut AlgorithmsAnnals of Operations Research, 2005
- On the capacitated vehicle routing problemMathematical Programming, 2003
- Optimal rectangular partitionsNetworks, 2002
- A Lagrangian relaxation approach to the edge-weighted clique problemEuropean Journal of Operational Research, 2001
- The volume algorithm: producing primal solutions with a subgradient methodMathematical Programming, 2000
- Efficient cuts in Lagrangean ‘Relax-and-cut’ schemesEuropean Journal of Operational Research, 1998
- Polyhedral techniques in combinatorial optimization I: TheoryStatistica Neerlandica, 1996
- Network Flows: Theory, Algorithms, and Applications.Journal of the Operational Research Society, 1994
- Facets of the three-index assignment polytopeDiscrete Applied Mathematics, 1989
- An SST‐based algorithm for the steiner problem in graphsNetworks, 1989