Using the analytic center in the feasibility pump

DOI10.1016/j.orl.2011.07.005zbMath1235.90098OpenAlexW2114896010MaRDI QIDQ408384

Daniel Baena, Jordi Castro

Publication date: 5 April 2012

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/12615

zbMATH Keywords

interior-point methodsanalytic centermixed-integer linear programmingprimal heuristicsfeasibility problem

Mathematics Subject Classification ID

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

Related Items (18)

Three ideas for a feasibility pump for nonconvex MINLP ⋮ Recursive central rounding for mixed integer programs ⋮ Fix-and-relax approaches for controlled tabular adjustment ⋮ An empirical evaluation of walk-and-round heuristics for mixed integer linear programs ⋮ Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps ⋮ Cutting plane selection with analytic centers and multiregression ⋮ The Chebyshev center as an alternative to the analytic center in the feasibility pump ⋮ Adaptive kernel search: a heuristic for solving mixed integer linear programs ⋮ A hybrid primal heuristic for finding feasible solutions to mixed integer programs ⋮ Feasibility Pump-like heuristics for mixed integer problems ⋮ Generation of feasible integer solutions on a massively parallel computer using the feasibility pump ⋮ Boosting the feasibility pump ⋮ 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 ⋮ Feasibility pump algorithm for sparse representation under Laplacian noise ⋮ Ten years of feasibility pump, and counting ⋮ An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs ⋮ Towards an objective feasibility pump for convex minlps

Uses Software

• MIPLIB
• CPLEX
• GLPK
• PCx
• Bonmin
• FEASPUMP
• MIPLIB2003

Cites Work

• Unnamed Item
• An interior point cutting plane heuristic for mixed integer programming
• An algorithmic framework for convex mixed integer nonlinear programs
• Feasibility pump 2.0
• Solving combinatorial optimization problems using Karmarkar's algorithm
• Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
• A feasibility pump heuristic for general mixed-integer problems
• Improving the feasibility pump
• The feasibility pump
• Mixed integer nonlinear programming using interior-point methods
• PCx: an interior-point code for linear programming

This page was built for publication: Using the analytic center in the feasibility pump