Feasibility Pump-like heuristics for mixed integer problems

DOI10.1016/j.dam.2013.06.018zbMath1471.90098OpenAlexW1995969950MaRDI QIDQ2448898

Stefano Lucidi, Francesco Rinaldi, Marianna De Santis

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

zbMATH Keywords

mixed integer programmingFrank-Wolfe algorithmfeasibility problemconcave penalty functions

Mathematics Subject Classification ID

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

Related Items (8)

Three ideas for a feasibility pump for nonconvex MINLP ⋮ Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps ⋮ Adaptive kernel search: a heuristic for solving mixed integer linear programs ⋮ A hybrid primal heuristic for finding feasible solutions to mixed integer programs ⋮ On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems ⋮ Feasibility pump algorithm for sparse representation under Laplacian noise ⋮ A constraints-aware reweighted feasibility pump approach ⋮ Ten years of feasibility pump, and counting

Uses Software

• MIPLIB
• CPLEX
• FEASPUMP
• MIPLIB2003
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Using the analytic center in the feasibility pump
• Boosting the feasibility pump
• Application-oriented mixed integer non-linear programming
• New results on the equivalence between zero-one programming and continuous concave programming
• Exact penalty functions for nonlinear integer programming problems
• Concave programming for minimizing the zero-norm over polyhedral sets
• Feasibility pump 2.0
• General purpose heuristics for integer programming. I
• General purpose heuristics for integer programming. II
• Solution of general linear complementarity problems via nondifferentiable concave minimization
• Local branching
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Pivot and shift -- a mixed integer programming heuristic
• MIPLIB 2003
• 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
• A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
• Efficient Heuristic Procedures for Integer Linear Programming with an Interior
• Benchmarking optimization software with performance profiles.

This page was built for publication: Feasibility Pump-like heuristics for mixed integer problems