Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization

DOI10.1016/j.ejco.2022.100051zbMath1528.90162OpenAlexW4307571142MaRDI QIDQ6114963

Stefan Schwarze, Oliver Stein, Benjamin Müller, Christoph Neumann

Publication date: 12 July 2023

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

Full work available at URL: https://doi.org/10.1016/j.ejco.2022.100051

zbMATH Keywords

granularityMILPMINLPvariable fixingdiving

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Heuristics for convex mixed integer nonlinear programs
• RENS. The optimal rounding
• Feasibility pump 2.0
• Approximation algorithms for combinatorial problems
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• Bounds on the objective value of feasible roundings
• Granularity in nonlinear mixed-integer optimization
• A feasible rounding approach for mixed-integer optimization problems
• Undercover: a primal MINLP heuristic exploring a largest sub-MIP
• Improving the feasibility pump
• The feasibility pump
• PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite
• A Greedy Heuristic for the Set-Covering Problem
• Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts
• Feasible rounding approaches for equality constrained mixed-integer optimization problems