Using the analytic center in the feasibility pump
From MaRDI portal
Publication:408384
DOI10.1016/J.ORL.2011.07.005zbMATH Open1235.90098OpenAlexW2114896010MaRDI QIDQ408384FDOQ408384
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
interior-point methodsprimal heuristicsfeasibility problemanalytic centermixed-integer linear programming
Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11)
Cites Work
- PCx: an interior-point code for linear programming
- An algorithmic framework for convex mixed integer nonlinear programs
- Feasibility pump 2.0
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- The feasibility pump
- An interior point cutting plane heuristic for mixed integer programming
- 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
- Mixed integer nonlinear programming using interior-point methods
- Title not available (Why is that?)
Cited In (19)
- Feasibility Pump-like heuristics for mixed integer problems
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
- Towards an objective feasibility pump for convex minlps
- Cutting plane selection with analytic centers and multiregression
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
- Four Good Reasons to Use an Interior Point Solver Within a MIP Solver
- Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps
- Generation of feasible integer solutions on a massively parallel computer using the feasibility pump
- Recursive central rounding for mixed integer programs
- Ten years of feasibility pump, and counting
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
- The Chebyshev center as an alternative to the analytic center in the feasibility pump
- Fix-and-relax approaches for controlled tabular adjustment
- Three ideas for a feasibility pump for nonconvex MINLP
- Boosting the feasibility pump
- Using multiple reference vectors and objective scaling 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 algorithm for sparse representation under Laplacian noise
Uses Software
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)
