Restrict-and-relax search for 0-1 mixed-integer programs
From MaRDI portal
Recommendations
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- Hybrid variable neighbourhood decomposition search for 0-1 mixed integer programming problem
- Resolution search and dynamic branch-and-bound
- New convergent heuristics for 0-1 mixed integer programming
Cites work
- Backdoor branching
- Benchmarking optimization software with performance profiles.
- Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Information-based branching schemes for binary linear mixed integer problems
- Local branching
- RENS. The optimal rounding
- The feasibility pump
Cited in
(8)- Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints
- A primal heuristic for optimizing the topology of gas networks based on dual information
- Generalized relax-and-fix heuristic
- Mathematical programming based heuristics for the 0--1 MIP: a survey
- A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- Adaptive kernel search: a heuristic for solving mixed integer linear programs
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
This page was built for publication: Restrict-and-relax search for 0-1 mixed-integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q743638)
