Generation of feasible integer solutions on a massively parallel computer using the feasibility pump
From MaRDI portal
Publication:1728378
DOI10.1016/j.orl.2017.10.003zbMath1409.90117OpenAlexW2765570909MaRDI QIDQ1728378
Publication date: 22 February 2019
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://www.osti.gov/biblio/1461251
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Parallel numerical computation (65Y05)
Related Items
Parallel computational optimization in operations research: a new integrative framework, literature review and research directions, Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs, Structure-driven fix-and-propagate heuristics for mixed integer programming
Uses Software
Cites Work
- Improving branch-and-cut performance by random sampling
- Using the analytic center in the feasibility pump
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
- Feasibility pump 2.0
- Local branching
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Could we use a million cores to solve an integer program?
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
- Pivot and shift -- a mixed integer programming heuristic
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
- MIPLIB 2003
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- The feasibility pump
- Mixed Integer Programming Computation
- Octane: A New Heuristic for Pure 0–1 Programs
- Pivot and Complement–A Heuristic for 0-1 Programming
