Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
DOI10.1007/S10589-017-9934-5zbMATH Open1392.90085OpenAlexW2744708081MaRDI QIDQ683326FDOQ683326
Authors: Lluís-Miquel Munguía, S. Ahmed, David A. Bader, Yufen Shao, G. L. Nemhauser 
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
Recommendations
- Adaptive large neighborhood search for mixed integer programming
- Tailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routing
- 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
- A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs
Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11)
Cites Work
- Octane: A New Heuristic for Pure 0–1 Programs
- Feasibility pump 2.0
- Local branching
- Using diversification, communication and parallelism to solve mixed-integer linear programs
- Measuring the impact of primal heuristics
- Conflict analysis in mixed integer programming
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- The feasibility pump
- Improving branch-and-cut performance by random sampling
- Using the analytic center in the feasibility pump
- A high-performance, portable implementation of the MPI message passing interface standard
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Variable neighborhood search and local branching
- An evolutionary algorithm for polishing mixed integer programming solutions
- Proximity search for 0--1 mixed-integer convex programming
- Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
- Recursive central rounding for mixed integer programs
- RENS. The optimal rounding
- Repairing MIP infeasibility through local branching
- ZI round, a MIP rounding heuristic
- Boosting the feasibility pump
- General purpose heuristics for integer programming. I
- General purpose heuristics for integer programming. II
- Pivot and shift -- a mixed integer programming heuristic
- Rounding and propagation heuristics for mixed integer programming
- Shift-and-propagate
- DINS, a MIP Improvement Heuristic
- On the knapsack closure of 0-1 integer linear programs
- A parallel local search framework for the fixed-charge multicommodity network flow problem
- Generation of feasible integer solutions on a massively parallel computer using the feasibility pump
- Could we use a million cores to solve an integer program?
Cited In (6)
- Generation of feasible integer solutions on a massively parallel computer using the feasibility pump
- Consensus-based Dantzig-Wolfe decomposition
- Tailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routing
- Adaptive large neighborhood search for mixed integer programming
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- Adaptive kernel search: a heuristic for solving mixed integer linear programs
Uses Software
This page was built for publication: Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q683326)
