Exploring relaxation induced neighborhoods to improve MIP solutions
- 21 May 2004
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 102 (1), 71-90
- https://doi.org/10.1007/s10107-004-0518-7
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Solving a Network Design ProblemAnnals of Operations Research, 2004
- Two Generic Schemes for Efficient and Robust Cooperative AlgorithmsPublished by Springer Science and Business Media LLC ,2004
- Octane: A New Heuristic for Pure 0–1 ProgramsOperations Research, 2001
- MIP: Theory and Practice — Closing the GapPublished by Springer Science and Business Media LLC ,2000
- Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement HeuristicINFORMS Journal on Computing, 1994
- A Computational Study of the Job-Shop Scheduling ProblemINFORMS Journal on Computing, 1991
- Recent Advances in Crew-Pairing Optimization at American AirlinesInforms Journal on Applied Analytics, 1991
- The Shifting Bottleneck Procedure for Job Shop SchedulingManagement Science, 1988
- Pivot and Complement–A Heuristic for 0-1 ProgrammingManagement Science, 1980
- Interior Path Methods for Heuristic Integer Programming ProceduresOperations Research, 1979