Feasibility Pump-like heuristics for mixed integer problems
From MaRDI portal
Publication:2448898
DOI10.1016/J.DAM.2013.06.018zbMATH Open1471.90098OpenAlexW1995969950MaRDI QIDQ2448898FDOQ2448898
Authors: Stefano Lucidi, M. De Santis, F. Rinaldi 
Publication date: 5 May 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.06.018
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11)
Cites Work
- MIPLIB 2003
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- Feasibility pump 2.0
- Local branching
- 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
- Using the analytic center in the feasibility pump
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Exact penalty functions for nonlinear integer programming problems
- Title not available (Why is that?)
- Concave programming for minimizing the zero-norm over polyhedral sets
- Boosting the feasibility pump
- Application-oriented mixed integer non-linear programming
- New results on the equivalence between zero-one programming and continuous concave programming
- General purpose heuristics for integer programming. I
- General purpose heuristics for integer programming. II
- Pivot and shift -- a mixed integer programming heuristic
- Efficient Heuristic Procedures for Integer Linear Programming with an Interior
- Solution of general linear complementarity problems via nondifferentiable concave minimization
- A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
Cited In (22)
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
- On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems
- Finding feasible solutions to hard mixed-integer programming problems using hybrid heuristics
- Matheuristics approaches for the satellite constellation design problem
- Pivot and shift -- a mixed integer programming heuristic
- Feasibility pump 2.0
- Generation of feasible integer solutions on a massively parallel computer using the feasibility pump
- Feasibility jump: an LP-free Lagrangian MIP heuristic
- Ten years of feasibility pump, and counting
- 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
- A feasibility pump heuristic for general mixed-integer problems
- The feasibility pump
- A new class of functions for measuring solution integrality in the feasibility pump approach
- Inexact feasibility pump for mixed integer nonlinear programming
- A constraints-aware reweighted feasibility pump approach
- Three ideas for a feasibility pump for nonconvex MINLP
- 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
- A New Approach to the Feasibility Pump in Mixed Integer Programming
Uses Software
This page was built for publication: Feasibility Pump-like heuristics for mixed integer problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2448898)
