Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
From MaRDI portal
Publication:683326
DOI10.1007/s10589-017-9934-5zbMath1392.90085OpenAlexW2744708081MaRDI QIDQ683326
Yufen Shao, Lluís-Miquel Munguía, Shabbir Ahmed, David A. Bader, Nemhauser, George I.
Publication date: 6 February 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-017-9934-5
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Adaptive large neighborhood search for mixed integer programming, Consensus-based Dantzig-Wolfe decomposition, Generation of feasible integer solutions on a massively parallel computer using the feasibility pump, Tailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routing, Structure-driven fix-and-propagate heuristics for mixed integer programming
Uses Software
Cites Work
- Unnamed Item
- Improving branch-and-cut performance by random sampling
- Recursive central rounding for mixed integer programs
- Using the analytic center in the feasibility pump
- Boosting the feasibility pump
- Proximity search for 0--1 mixed-integer convex programming
- Shift-and-propagate
- A high-performance, portable implementation of the MPI message passing interface standard
- ZI round, a MIP rounding heuristic
- RENS. The optimal rounding
- Feasibility pump 2.0
- General purpose heuristics for integer programming. I
- General purpose heuristics for integer programming. II
- Local branching
- A parallel local search framework for the fixed-charge multicommodity network flow problem
- Using diversification, communication and parallelism to solve mixed-integer linear programs
- Generation of feasible integer solutions on a massively parallel computer using the feasibility pump
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Could we use a million cores to solve an integer program?
- Pivot and shift -- a mixed integer programming heuristic
- Measuring the impact of primal heuristics
- Repairing MIP infeasibility through local branching
- 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
- Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
- Octane: A New Heuristic for Pure 0–1 Programs
- Rounding and Propagation Heuristics for Mixed Integer Programming
- DINS, a MIP Improvement Heuristic
