Exploring relaxation induced neighborhoods to improve MIP solutions
暂无分享,去创建一个
[1] David L. Woodruff,et al. Scatter Search to Generate Diverse MIP Solutions , 2000 .
[2] Philippe Baptiste,et al. Incorporating Efficient Operations Research Algorithms in Constraint-Based Scheduling , 1995 .
[3] Frederick S. Hillier,et al. Efficient Heuristic Procedures for Integer Linear Programming with an Interior , 1969, Oper. Res..
[4] Matteo Fischetti,et al. Local branching , 2003, Math. Program..
[5] E. Balas,et al. Pivot and Complement–A Heuristic for 0-1 Programming , 1980 .
[6] Mathieu Van Vyve,et al. A solution approach of production planning problems based on compact formulations for single-item lot-sizing models , 2004, 4OR.
[7] Alain Chabrier,et al. Solving a Network Design Problem , 2004, Ann. Oper. Res..
[8] Emilie Danna. Intégration des techniques de recherche locale à la programmation linéaire en nombres entiers , 2004 .
[9] François Laburthe,et al. SaLSA : a Specifiction Language for Search Algorithms , 1997 .
[10] Egon Balas,et al. Octane: A New Heuristic for Pure 0-1 Programs , 2001, Oper. Res..
[11] Narendra Jussien,et al. Local search with constraint propagation and conflict-based heuristics , 2000, Artif. Intell..
[12] L. Darrell Whitley,et al. A Comparison of Genetic Algorithms for the Static Job Shop Scheduling Problem , 2000, PPSN.
[13] William J. Cook,et al. A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.
[14] Egon Balas,et al. The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .
[15] Robert E. Bixby,et al. MIP: Theory and Practice - Closing the Gap , 1999, System Modelling and Optimization.
[16] Hisashi Mine,et al. A heuristic algorithm for mixed-integer programming problems , 1974 .
[17] Paul Shaw,et al. Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.
[18] Philippe Baptiste,et al. Heuristic Control of a Constraint-Based Algorithm for the Preemptive Job-Shop Scheduling Problem , 1999, J. Heuristics.
[19] Christian Artigues,et al. A heuristic for solving the frequency assignment problem , 2002 .
[20] David L. Woodruff,et al. Integrating pivot based search with branch and bound for binary MIPs , 2000 .
[21] Claude Le Pape,et al. Two Generic Schemes for Efficient and Robust Cooperative Algorithms , 2004 .
[22] Jonathan Eckstein,et al. Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming , 2007, J. Heuristics.
[23] Frederick S. Hillier,et al. Interior Path Methods for Heuristic Integer Programming Procedures , 1979, Oper. Res..
[24] F. Glover,et al. Fundamentals of Scatter Search and Path Relinking , 2000 .
[25] Martin W. P. Savelsbergh,et al. An Updated Mixed Integer Programming Library: MIPLIB 3.0 , 1998 .
[26] Ulrich Junker,et al. Preference-Based Search for Scheduling , 2000, AAAI/IAAI.
[27] Sheldon Howard Jacobson,et al. The Theory and Practice of Simulated Annealing , 2003, Handbook of Metaheuristics.
[28] Eric Gelman,et al. Recent Advances in Crew-Pairing Optimization at American Airlines , 1991 .
[29] François Laburthe,et al. Disjunctive Scheduling with Task Intervals , 1995 .
[30] Kurt Jörnsten,et al. Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic , 1994, INFORMS J. Comput..
[31] Dorothea Heiss-Czedik,et al. An Introduction to Genetic Algorithms. , 1997, Artificial Life.
[32] Steven Minton,et al. Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..