Structure-driven fix-and-propagate heuristics for mixed integer programming
From MaRDI portal
Publication:2295978
DOI10.1007/s12532-019-00159-1zbMath1432.90091OpenAlexW2794901481WikidataQ128079342 ScholiaQ128079342MaRDI QIDQ2295978
Gerald Gamrath, Timo Berthold, Stefan Heinz, Michael Winkler
Publication date: 17 February 2020
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-019-00159-1
mixed integer programminglarge neighborhood searchMIPprimal heuristicsIPfix-and-propagatestart heuristics
Integer programming (90C10) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Transferring information across restarts in MIP, Feasibility jump: an LP-free Lagrangian MIP heuristic, Structure-driven fix-and-propagate heuristics for mixed integer programming, Computational aspects of infeasibility analysis in mixed integer programming, Generalized relax-and-fix heuristic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proximity search for 0--1 mixed-integer convex programming
- Faster integer-feasibility in mixed-integer linear programs by branching to force change
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
- ZI round, a MIP rounding heuristic
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
- Restrict-and-relax search for 0-1 mixed-integer programs
- RENS. The optimal rounding
- Feasibility pump 2.0
- Local branching
- Adaptive kernel search: a heuristic for solving mixed integer linear programs
- A hybrid primal heuristic for finding feasible solutions to mixed integer programs
- Generation of feasible integer solutions on a massively parallel computer using the feasibility pump
- Exploring relaxation induced neighborhoods to improve MIP solutions
- A brief history of linear and mixed-integer programming computation
- Conflict graphs in solving integer programming problems
- Experiments with conflict analysis in mixed integer programming
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- Measuring the impact of primal heuristics
- Repairing MIP infeasibility through local branching
- MIPLIB 2003
- Conflict analysis in mixed integer programming
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- Variable neighborhood search and local branching
- The feasibility pump
- An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
- An Automatic Method of Solving Discrete Programming Problems
- Presolve Reductions in Mixed Integer Programming
- Mixed Integer Programming Computation
- Rapid Learning for Binary Programs
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Degree-two Inequalities, Clique Facets, and Biperfect Graphs
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Improving the Performance of MIP and MINLP Solvers by Integrated Heuristics
- Improving the Randomization Step in Feasibility Pump
- Four Good Reasons to Use an Interior Point Solver Within a MIP Solver
- Rounding and Propagation Heuristics for Mixed Integer Programming
- Mixed Integer Programming: Analyzing 12 Years of Progress
- Computational Integer Programming and Cutting Planes
- Detecting and Exploiting Permutation Structures in MIPs
- DINS, a MIP Improvement Heuristic
- A tree-search algorithm for mixed integer programming problems
- The mixed vertex packing problem.
