General purpose heuristics for integer programming. I
From MaRDI portal
Publication:1365114
DOI10.1007/BF00132504zbMath0887.90123OpenAlexW4242178374MaRDI QIDQ1365114
Publication date: 28 August 1997
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00132504
Related Items
Adaptive kernel search: a heuristic for solving mixed integer linear programs, A hybrid primal heuristic for finding feasible solutions to mixed integer programs, An interior point cutting plane heuristic for mixed integer programming, Feasibility Pump-like heuristics for mixed integer problems, Repairing MIP infeasibility through local branching, Boosting the feasibility pump, A feasibility pump heuristic for general mixed-integer problems, Improving the feasibility pump, Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs, Shift-and-propagate, Mixed integer programming: A historical perspective with Xpress-MP, Variable neighborhood search and local branching, A computational study of parametric tabu search for 0-1 mixed integer programs, RENS. The optimal rounding, Feasibility pump 2.0, The feasibility pump
Uses Software
Cites Work
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- FACES OF AN INTEGER POLYHEDRON
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Hypercylindrically Deduced Cuts in Zero-One Integer Programs
- Some continuous functions related to corner polyhedra
- Cut search methods in integer programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
