General purpose heuristics for integer programming. II
From MaRDI portal
Publication:1372914
DOI10.1023/A:1009631530787zbMATH Open0898.90094OpenAlexW1973471744MaRDI QIDQ1372914FDOQ1372914
Authors: Fred Glover, Manuel Laguna 
Publication date: 8 November 1998
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009631530787
Recommendations
- General purpose heuristics for integer programming. I
- A generalized Wedelin heuristic for integer programming
- Approximability of Integer Programming with Generalised Constraints
- Integer programming as a framework for optimization and approximability
- A computational study of an objective hyperplane search heuristic for the general integer linear programming problem
- scientific article; zbMATH DE number 1996459
- A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
- A two-phase optimization procedure for integer programming problems
- A heuristic algorithm for solving integer linear programming problem and unveiling the applications
- An integer programming column generation principle for heuristic search methods
Cited In (22)
- Feasibility Pump-like heuristics for mixed integer problems
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
- Mixed integer programming: A historical perspective with Xpress-MP
- Repairing MIP infeasibility through local branching
- Mathematical programming based heuristics for the 0--1 MIP: a survey
- Large-scale mixed integer programming: Benders-type heuristics
- A computational study of parametric tabu search for 0-1 mixed integer programs
- Feasibility pump 2.0
- A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
- An interior point cutting plane heuristic for mixed integer programming
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- The feasibility pump
- RENS. The optimal rounding
- Boosting the feasibility pump
- Variable neighborhood search and local branching
- On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs
- Adaptive kernel search: a heuristic for solving mixed integer linear programs
- A hybrid primal heuristic for finding feasible solutions to mixed integer programs
- Heuristics of the branch-cut-and-price-framework SCIP
- A generalized Wedelin heuristic for integer programming
- Shift-and-propagate
This page was built for publication: General purpose heuristics for integer programming. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372914)
