Recursive central rounding for mixed integer programs

DOI10.1016/j.cor.2013.09.008zbMath1348.90493OpenAlexW1978147206MaRDI QIDQ336910

Joe Naoum-Sawaya

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.09.008

zbMATH Keywords

analytic centerfeasibilityroundingmixed integer problems

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Improved branching disjunctions for branch-and-bound: an analytic center approach ⋮ Cutting plane selection with analytic centers and multiregression ⋮ Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs ⋮ Four Good Reasons to Use an Interior Point Solver Within a MIP Solver ⋮ Ten years of feasibility pump, and counting ⋮ An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs

Uses Software

• SCIP
• MIPLIB
• FEASPUMP
• MIPLIB2003
• CORAL
• MIQPlib

Cites Work

• Using the analytic center in the feasibility pump
• An interior point cutting plane heuristic for mixed integer programming
• ZI round, a MIP rounding heuristic
• The submodular knapsack polytope
• Feasibility pump 2.0
• A feasibility pump heuristic for general mixed-integer problems
• Improving the feasibility pump
• The feasibility pump
• Decomposition and Nondifferentiable Optimization with the Projective Algorithm
• A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
• Heuristics of the Branch-Cut-and-Price-Framework SCIP
• Unnamed Item
• Unnamed Item