Feasibility pump 2.0

DOI10.1007/S12532-009-0007-3zbMath1180.90208OpenAlexW2137277194MaRDI QIDQ1043854

Domenico Salvagnin, Matteo Fischetti

Publication date: 9 December 2009

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12532-009-0007-3

zbMATH Keywords

constraint propagationconstraint programmingmixed-integer programmingprimal heuristics

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (40)

Three ideas for a feasibility pump for nonconvex MINLP ⋮ Adaptive large neighborhood search for mixed integer programming ⋮ Recursive central rounding for mixed integer programs ⋮ MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration ⋮ Inexact feasibility pump for mixed integer nonlinear programming ⋮ 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 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 ⋮ Using the analytic center in the feasibility pump ⋮ Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization ⋮ Adaptive kernel search: a heuristic for solving mixed integer linear programs ⋮ A hybrid primal heuristic for finding feasible solutions to mixed integer programs ⋮ Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs ⋮ Improving the Randomization Step in Feasibility Pump ⋮ Heuristics for convex mixed integer nonlinear programs ⋮ Feasibility Pump-like heuristics for mixed integer problems ⋮ Primal Heuristics for Branch and Price: The Assets of Diving Methods ⋮ Undercover: a primal MINLP heuristic exploring a largest sub-MIP ⋮ Generation of feasible integer solutions on a massively parallel computer using the feasibility pump ⋮ Boosting the feasibility pump ⋮ Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts ⋮ Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs ⋮ A computational study of primal heuristics inside an MI(NL)P solver ⋮ Shift-and-propagate ⋮ A relax-and-cut framework for Gomory mixed-integer cuts ⋮ A primal heuristic for optimizing the topology of gas networks based on dual information ⋮ A proximal-point outer approximation algorithm ⋮ Solving linear programs with complementarity constraints using branch-and-cut ⋮ Hybrid heuristics for a short sea inventory routing problem ⋮ Structure-driven fix-and-propagate heuristics for mixed integer programming ⋮ Feasibility pump algorithm for sparse representation under Laplacian noise ⋮ RENS. The optimal rounding ⋮ Granularity in nonlinear mixed-integer optimization ⋮ Ten years of feasibility pump, and counting ⋮ FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming ⋮ An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs ⋮ Towards an objective feasibility pump for convex minlps

Uses Software

• SCIP
• MIPLIB
• CPLEX
• Benchmarks for Optimization Software
• FEASPUMP
• Gecode
• MIPLIB2003
• Tabu search
• Octane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An integrated method for planning and scheduling to minimize tardiness
• General purpose heuristics for integer programming. I
• General purpose heuristics for integer programming. II
• Local branching
• Solving zero-one mixed integer programming problems using tabu search
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Computational techniques of the simplex method
• 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
• Variable neighborhood search and local branching
• The feasibility pump
• A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem
• Octane: A New Heuristic for Pure 0–1 Programs
• Pivot and Complement–A Heuristic for 0-1 Programming
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
• Efficient Heuristic Procedures for Integer Linear Programming with an Interior
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Feasibility pump 2.0