Ten years of feasibility pump, and counting
DOI10.1007/S13675-018-0109-7zbMATH Open1430.90429OpenAlexW2902383031WikidataQ115202352 ScholiaQ115202352MaRDI QIDQ2329705FDOQ2329705
Authors: Timo Berthold, Andrea Lodi, Domenico Salvagnin 
Publication date: 18 October 2019
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13675-018-0109-7
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11)
Cites Work
- An algorithmic framework for convex mixed integer nonlinear programs
- A feasibility pump for mixed integer nonlinear programs
- Feasibility pump 2.0
- Local branching
- A storm of feasibility pumps for nonconvex MINLP
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- The feasibility pump
- Towards an objective feasibility pump for convex minlps
- A new class of functions for measuring solution integrality in the feasibility pump approach
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Using the analytic center in the feasibility pump
- Heuristics for convex mixed integer nonlinear programs
- A New Approach to the Feasibility Pump in Mixed Integer Programming
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- Proximity search for 0--1 mixed-integer convex programming
- Title not available (Why is that?)
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Recursive central rounding for mixed integer programs
- Modeling and solving the mixed capacitated general routing problem
- Repairing MIP infeasibility through local branching
- Inexact feasibility pump for mixed integer nonlinear programming
- Boosting the feasibility pump
- Variable neighbourhood pump heuristic for 0-1 mixed integer programming feasibility
- Three ideas for a feasibility pump for nonconvex MINLP
- Penalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumps
- Feasibility pump for aircraft deconfliction with speed regulation
- Feasibility Pump-like heuristics for mixed integer problems
- Cloud branching
- Improving the randomization step in feasibility pump
- A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming
Cited In (9)
- Penalty alternating direction methods for mixed-integer optimal control with combinatorial constraints
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
- Matheuristics approaches for the satellite constellation design problem
- Addendum to: ``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
- The supporting hyperplane optimization toolkit for convex MINLP
- The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers
- Boosting the feasibility pump
- Using multiple reference vectors and objective scaling in the feasibility pump
Uses Software
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)
