Using the analytic center in the feasibility pump

DOI10.1016/J.ORL.2011.07.005MaRDI QIDQ408384zbMATH OpenOpenAlexFDO

Authors 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 methodsprimal heuristicsfeasibility problemanalytic centermixed-integer linear programming

Mathematics Subject Classification ID

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

Recommendations

• A New Approach to the Feasibility Pump in Mixed Integer Programming
• The feasibility pump
• Feasibility pump 2.0
• Boosting the feasibility pump
• Improving the feasibility pump

Cites work

• scientific article; zbMATH DE number 617926 (Why is no real title available?)
• A feasibility pump heuristic for general mixed-integer problems
• An algorithmic framework for convex mixed integer nonlinear programs
• An interior point cutting plane heuristic for mixed integer programming
• Feasibility pump 2.0
• Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
• Improving the feasibility pump
• Mixed integer nonlinear programming using interior-point methods
• PCx: an interior-point code for linear programming
• Solving combinatorial optimization problems using Karmarkar's algorithm
• The feasibility pump

Cited in

(19)

• Generation of feasible integer solutions on a massively parallel computer using 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
• Penalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumps
• Three ideas for a feasibility pump for nonconvex MINLP
• Cutting plane selection with analytic centers and multiregression
• Boosting the feasibility pump
• Using multiple reference vectors and objective scaling in the feasibility pump
• Feasibility Pump-like heuristics for mixed integer problems
• Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
• An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
• Feasibility pump algorithm for sparse representation under Laplacian noise
• The Chebyshev center as an alternative to the analytic center in the feasibility pump
• Four Good Reasons to Use an Interior Point Solver Within a MIP Solver
• Towards an objective feasibility pump for convex minlps
• Fix-and-relax approaches for controlled tabular adjustment
• Recursive central rounding for mixed integer programs
• An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
• Ten years of feasibility pump, and counting

Describes a project that uses

Uses Software

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408384)