Ten years of feasibility pump, and counting

DOI10.1007/S13675-018-0109-7MaRDI QIDQ2329705zbMATH OpenOpenAlexWikidataFDO

Authors Timo Berthold, Andrea Lodi, Domenico Salvagnin

Publication date 18 October 2019

Published in EURO Journal on Computational Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1007/s13675-018-0109-7

zbMATH Keywords

mixed integer programmingprimal heuristicsmixed integer programming solvers

Mathematics Subject Classification ID

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

Recommendations

• Improving the feasibility pump
• A feasibility pump heuristic for general mixed-integer problems
• The feasibility pump
• Feasibility pump 2.0
• A New Approach to the Feasibility Pump in Mixed Integer Programming

Cites work

• scientific article; zbMATH DE number 3972641 (Why is no real title available?)
• A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming
• A New Approach to the Feasibility Pump in Mixed Integer Programming
• A feasibility pump for mixed integer nonlinear programs
• A feasibility pump heuristic for general mixed-integer problems
• A new class of functions for measuring solution integrality in the feasibility pump approach
• A storm of feasibility pumps for nonconvex MINLP
• An algorithmic framework for convex mixed integer nonlinear programs
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Boosting the feasibility pump
• Cloud branching
• Feasibility Pump-like heuristics for mixed integer problems
• Feasibility pump 2.0
• Feasibility pump for aircraft deconfliction with speed regulation
• Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
• Heuristics for convex mixed integer nonlinear programs
• Improving the feasibility pump
• Improving the randomization step in feasibility pump
• Inexact feasibility pump for mixed integer nonlinear programming
• Local branching
• Modeling and solving the mixed capacitated general routing problem
• Penalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumps
• Proximity search for 0--1 mixed-integer convex programming
• Recursive central rounding for mixed integer programs
• Repairing MIP infeasibility through local branching
• The feasibility pump
• Three ideas for a feasibility pump for nonconvex MINLP
• Towards an objective feasibility pump for convex minlps
• Using the analytic center in the feasibility pump
• Variable neighbourhood pump heuristic for 0-1 mixed integer programming feasibility

Cited in

(9)

• The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers
• Boosting the feasibility pump
• FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
• Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem
• Using multiple reference vectors and objective scaling in the feasibility pump
• The supporting hyperplane optimization toolkit for convex MINLP
• Matheuristics approaches for the satellite constellation design problem
• Addendum to: ``FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
• Penalty alternating direction methods for mixed-integer optimal control with combinatorial constraints

Describes a project that uses

Uses Software

• Bonmin
• FEASPUMP
• FPBH.jl

This page was built for publication: Ten years of feasibility pump, and counting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329705)