A New Approach to the Feasibility Pump in Mixed Integer Programming
From MaRDI portal
Publication:4899014
DOI10.1137/110823596zbMATH Open1277.90077OpenAlexW2071203670MaRDI QIDQ4899014FDOQ4899014
Authors: Natashia Boland, Faramroze G. Engineer, Angelos Tsoukalas, A. C. Eberhard 
Publication date: 4 January 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1959.13/939360
Recommendations
- A feasibility pump for mixed integer nonlinear programs
- A feasibility pump heuristic for general mixed-integer problems
- Feasibility Pump-like heuristics for mixed integer problems
- Inexact feasibility pump for mixed integer nonlinear programming
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
- Penalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumps
- Addendum to: ``FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
- scientific article; zbMATH DE number 786571
- Variable neighbourhood pump heuristic for 0-1 mixed integer programming feasibility
- A constraints-aware reweighted feasibility pump approach
Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Mixed integer programming (90C11)
Cited In (21)
- Towards an objective feasibility pump for convex minlps
- Repairing MIP infeasibility through local branching
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
- Improving the Randomization Step in Feasibility Pump
- Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps
- Feasibility pump 2.0
- Proximity search for 0--1 mixed-integer convex programming
- A learn‐and‐construct framework for general mixed‐integer programming problems
- Solving Multiobjective Mixed Integer Convex Optimization Problems
- Ten years of feasibility pump, and counting
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- A study of progressive hedging for stochastic integer programming
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- The feasibility pump
- Enumeration and Multicriteria Selection of Orthogonal Minimally Aliased Response Surface Designs
- A constraints-aware reweighted feasibility pump approach
- Three ideas for a feasibility pump for nonconvex MINLP
- Using multiple reference vectors and objective scaling in the feasibility pump
- Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs
- Feasibility pump algorithm for sparse representation under Laplacian noise
Uses Software
This page was built for publication: A New Approach to the Feasibility Pump in Mixed Integer Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899014)
