Boosting the feasibility pump
From MaRDI portal
Publication:495939
DOI10.1007/S12532-014-0068-9zbMath1323.65065OpenAlexW2041695750MaRDI QIDQ495939
Faramroze Engineer, Natashia Boland, Matteo Fischetti, Angelos Tsoukalas, Andrew S. Eberhard, Savelsbergh, Martin W. P.
Publication date: 16 September 2015
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-014-0068-9
algorithmnumerical examplelinear programmingmixed integer programmingline searchfeasibility pumpfeasible solutions
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Linear programming (90C05)
Related Items (21)
Inexact feasibility pump for mixed integer nonlinear programming ⋮ Convex analysis in groups and semigroups: a sampler ⋮ Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps ⋮ A feasible rounding approach for mixed-integer optimization problems ⋮ A matheuristic for tri-objective binary integer linear programming ⋮ A learn‐and‐construct framework for general mixed‐integer programming problems ⋮ 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 ⋮ Improving the Randomization Step in Feasibility Pump ⋮ Feasibility Pump-like heuristics for mixed integer problems ⋮ A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming ⋮ Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs ⋮ Using multiple reference vectors and objective scaling in the feasibility pump ⋮ Four Good Reasons to Use an Interior Point Solver Within a MIP Solver ⋮ Matheuristics approaches for the satellite constellation design problem ⋮ Enumeration and Multicriteria Selection of Orthogonal Minimally Aliased Response Surface Designs ⋮ Feasibility pump algorithm for sparse representation under Laplacian noise ⋮ A constraints-aware reweighted feasibility pump approach ⋮ Ten years of feasibility pump, and counting ⋮ FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
Uses Software
Cites Work
- Unnamed Item
- Using the analytic center in the feasibility pump
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- An interior point cutting plane heuristic for mixed integer programming
- Feasibility pump 2.0
- General purpose heuristics for integer programming. I
- General purpose heuristics for integer programming. II
- Local branching
- Programming constraint services. High-level programming of standard and new constraint services
- Solving zero-one mixed integer programming problems using tabu search
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Analyticity of the central path at the boundary point in semidefinite programming
- Pivot and shift -- a mixed integer programming heuristic
- Conflict analysis in mixed integer programming
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- The feasibility pump
- A New Class of Functions for Measuring Solution Integrality in the Feasibility Pump Approach
- Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility
- Solving Real-World Linear Programs: A Decade and More of Progress
- Pivot and Complement–A Heuristic for 0-1 Programming
- Interior Path Methods for Heuristic Integer Programming Procedures
- Experimental results on Hillier's linear search
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Efficient Heuristic Procedures for Integer Linear Programming with an Interior
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: Boosting the feasibility pump
