Ten years of feasibility pump, and counting
From MaRDI portal
Publication:2329705
DOI10.1007/s13675-018-0109-7zbMath1430.90429OpenAlexW2902383031WikidataQ115202352 ScholiaQ115202352MaRDI QIDQ2329705
Andrea Lodi, Timo Berthold, 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
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
The supporting hyperplane optimization toolkit for convex MINLP, Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem, The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers, 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
Uses Software
Cites Work
- Unnamed Item
- Towards an objective feasibility pump for convex minlps
- Recursive central rounding for mixed integer programs
- Inexact feasibility pump for mixed integer nonlinear programming
- Modeling and solving the mixed capacitated general routing problem
- Using the analytic center in the feasibility pump
- Heuristics for convex mixed integer nonlinear programs
- Boosting the feasibility pump
- Proximity search for 0--1 mixed-integer convex programming
- Feasibility pump for aircraft deconfliction with speed regulation
- An algorithmic framework for convex mixed integer nonlinear programs
- A feasibility pump for mixed integer nonlinear programs
- Feasibility pump 2.0
- Local branching
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- A storm of feasibility pumps for nonconvex MINLP
- Three ideas for a feasibility pump for nonconvex MINLP
- Feasibility Pump-like heuristics for mixed integer problems
- Repairing MIP infeasibility through local branching
- 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
- Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Improving the Randomization Step in Feasibility Pump
- A New Approach to the Feasibility Pump in Mixed Integer Programming
- Cloud Branching
- A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming
- Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps
