A fix-propagate-repair heuristic for mixed integer programming
From MaRDI portal
Cites work
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs
- Adaptive large neighborhood search for mixed integer programming
- An evolutionary algorithm for polishing mixed integer programming solutions
- DINS, a MIP Improvement Heuristic
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Faster integer-feasibility in mixed-integer linear programs by branching to force change
- Feasibility jump: an LP-free Lagrangian MIP heuristic
- Feasibility pump 2.0
- Four Good Reasons to Use an Interior Point Solver Within a MIP Solver
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 7124428 (Why is no real title available?)
- Implementing automatic benders decomposition in a modern MIP solver
- Local branching
- Local search algorithms for SAT: an empirical evaluation
- Measuring the impact of primal heuristics
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- Mixed integer programming: analyzing 12 years of progress
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
- Rapid learning for binary programs
- RENS. The optimal rounding
- Repairing MIP infeasibility through local branching
- Shift-and-propagate
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- The feasibility pump
- ZI round, a MIP rounding heuristic
This page was built for publication: A fix-propagate-repair heuristic for mixed integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7008342)
