Feasibility jump: an LP-free Lagrangian MIP heuristic
From MaRDI portal
Publication:6175707
DOI10.1007/s12532-023-00234-8zbMath1517.90084OpenAlexW4324354234WikidataQ125097776 ScholiaQ125097776MaRDI QIDQ6175707
Bjørnar Luteberget, Giorgio Sartor
Publication date: 24 July 2023
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-023-00234-8
Lagrangian relaxationmetaheuristicsmixed integer linear programmingguided local searchprimal heuristics
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proximity search for 0--1 mixed-integer convex programming
- Shift-and-propagate
- RENS. The optimal rounding
- About Lagrangian methods in integer optimization
- Local branching
- Solving zero-one mixed integer programming problems using tabu search
- Exploring relaxation induced neighborhoods to improve MIP solutions
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- Efficient local search for pseudo Boolean optimization
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- Pivot and shift -- a mixed integer programming heuristic
- The feasibility pump
- Mixed Integer Programming Computation
- A Survey of Lagrangean Techniques for Discrete Optimization
- Conflict-Driven Heuristics for Mixed Integer Programming
- Integer Programming
- Exploiting Erraticism in Search
- MIP‐and‐refine matheuristic for smart grid energy management
- Feasibility jump: an LP-free Lagrangian MIP heuristic
This page was built for publication: Feasibility jump: an LP-free Lagrangian MIP heuristic
