Last fifty years of integer linear programming: A focus on recent practical advances
Top Cited Papers
Open Access
- 19 November 2024
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 324 (3) , 707-731
Abstract
No abstract availableThis publication has 231 references indexed in Scilit:
- Decision Diagrams for Optimization2016
- Dual-Feasible Functions for Integer Programming and Combinatorial Optimization2016
- New dynamic programming algorithms for the resource constrained elementary shortest path problemNetworks, 2007
- Acceleration of cutting‐plane and column generation algorithms: Applications to network designNetworks, 2006
- Chvátal closures for mixed integer programming problemsMathematical Programming, 1990
- Facet identification for the symmetric traveling salesman polytopeMathematical Programming, 1990
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- State‐space relaxation procedures for the computation of bounds to routing problemsNetworks, 1981
- Generalized Benders decompositionJournal of Optimization Theory and Applications, 1972
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962