A feasibility pump heuristic for general mixed-integer problems

DOI10.1016/J.DISOPT.2006.10.001zbMath1169.90415OpenAlexW2172226214MaRDI QIDQ2471275

Andrea Lodi, Matteo Fischetti, Livio Bertacco

Publication date: 22 February 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2006.10.001

zbMATH Keywords

heuristics mixed-integer programming feasibility problem computational analysis

Mathematics Subject Classification ID

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

Related Items (52)

Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility ⋮ Three ideas for a feasibility pump for nonconvex MINLP ⋮ Algorithms and Software for Convex Mixed Integer Nonlinear Programs ⋮ Recursive central rounding for mixed integer programs ⋮ MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration ⋮ A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines ⋮ Inexact feasibility pump for mixed integer nonlinear programming ⋮ An empirical evaluation of walk-and-round heuristics for mixed integer linear programs ⋮ Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints ⋮ Mathematical programming based heuristics for the 0--1 MIP: a survey ⋮ A decomposition heuristic for mixed-integer supply chain problems ⋮ 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 ⋮ Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints ⋮ Using the analytic center in the feasibility pump ⋮ A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphs ⋮ 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 ⋮ An interior point cutting plane heuristic for mixed integer programming ⋮ A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times ⋮ Feasibility Pump-like heuristics for mixed integer problems ⋮ Primal Heuristics for Branch and Price: The Assets of Diving Methods ⋮ Generation of feasible integer solutions on a massively parallel computer using the feasibility pump ⋮ Heuristics of the Branch-Cut-and-Price-Framework SCIP ⋮ Boosting the feasibility pump ⋮ Improving the feasibility pump ⋮ Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs ⋮ Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning ⋮ Proximity search for 0--1 mixed-integer convex programming ⋮ Shift-and-propagate ⋮ A computational study of parametric tabu search for 0-1 mixed integer programs ⋮ Using multiple reference vectors and objective scaling in the feasibility pump ⋮ Integrality gap minimization heuristics for binary mixed integer nonlinear programming ⋮ A simple effective heuristic for embedded mixed-integer quadratic programming ⋮ Structure-driven fix-and-propagate heuristics for mixed integer programming ⋮ Feasibility pump algorithm for sparse representation under Laplacian noise ⋮ RENS. The optimal rounding ⋮ A feasibility pump for mixed integer nonlinear programs ⋮ Improving the performance of DICOPT in convex MINLP problems using a feasibility pump ⋮ A constraints-aware reweighted feasibility pump approach ⋮ On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs ⋮ Unnamed Item ⋮ Improving Benders decomposition using a genetic algorithm ⋮ Feasibility pump 2.0 ⋮ Ten years of feasibility pump, and counting ⋮ Generalized relax-and-fix heuristic ⋮ An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs ⋮ Towards an objective feasibility pump for convex minlps

Uses Software

Cites Work

This page was built for publication: A feasibility pump heuristic for general mixed-integer problems