Rounding and Propagation Heuristics for Mixed Integer Programming
From MaRDI portal
Publication:5176284
DOI10.1007/978-3-642-29210-1_12zbMath1306.90100OpenAlexW1600211004MaRDI QIDQ5176284
Tobias Achterberg, Gregor Hendel, Timo Berthold
Publication date: 3 March 2015
Published in: Operations Research Proceedings (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29210-1_12
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Adaptive large neighborhood search for mixed integer programming, Guidelines for the computational testing of machine learning approaches to vehicle routing problems, Local branching relaxation heuristics for integer linear programs, From feasibility to improvement to proof: three phases of solving mixed-integer programs, Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs, A computational study of primal heuristics inside an MI(NL)P solver, Mixed-integer linear programming heuristics for the prepack optimization problem, Proximity search for 0--1 mixed-integer convex programming, Shift-and-propagate, A primal heuristic for optimizing the topology of gas networks based on dual information, Rounding and Propagation Heuristics for Mixed Integer Programming, Improving strong branching by domain propagation, Structure-driven fix-and-propagate heuristics for mixed integer programming, Solving robust bin-packing problems with a branch-and-price approach, Multi-modal supply chain distribution problem
Uses Software
Cites Work
