Restrict-and-relax search for 0-1 mixed-integer programs

DOI10.1007/S13675-013-0007-YzbMath1296.90081OpenAlexW2032098373MaRDI QIDQ743638

Menal Guzelsoy, Savelsbergh, Martin W. P., Nemhauser, George I.

Publication date: 30 September 2014

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13675-013-0007-y

zbMATH Keywords

branch-and-boundfeasible solutions0-1 integer programmingrestrict-and-relax

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11)

Related Items (8)

A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines ⋮ Mathematical programming based heuristics for the 0--1 MIP: a survey ⋮ Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints ⋮ 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 ⋮ A primal heuristic for optimizing the topology of gas networks based on dual information ⋮ Structure-driven fix-and-propagate heuristics for mixed integer programming ⋮ Generalized relax-and-fix heuristic

Uses Software

• MIPLIB
• SYMPHONY
• FEASPUMP

Cites Work

• RENS. The optimal rounding
• Local branching
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Information-based branching schemes for binary linear mixed integer problems
• The feasibility pump
• Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
• Backdoor Branching
• Benchmarking optimization software with performance profiles.

This page was built for publication: Restrict-and-relax search for 0-1 mixed-integer programs