Inexact feasibility pump for mixed integer nonlinear programming
From MaRDI portal
Recommendations
Cites work
- A feasibility pump for mixed integer nonlinear programs
- A feasibility pump heuristic for general mixed-integer problems
- A primal heuristic for optimizing the topology of gas networks based on dual information
- A storm of feasibility pumps for nonconvex MINLP
- Boosting the feasibility pump
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Feasibility pump 2.0
- Heuristics for convex mixed integer nonlinear programs
- Improving the feasibility pump
- Inexact solution of NLP subproblems in MINLP
- Proximity search for 0--1 mixed-integer convex programming
- The feasibility pump
- Towards an objective feasibility pump for convex minlps
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
Cited in
(9)- Three ideas for a feasibility pump for nonconvex MINLP
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
- Matheuristics approaches for the satellite constellation design problem
- A feasibility pump heuristic for general mixed-integer problems
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming
- A New Approach to the Feasibility Pump in Mixed Integer Programming
- Inexact solution of NLP subproblems in MINLP
- A storm of feasibility pumps for nonconvex MINLP
- Ten years of feasibility pump, and counting
This page was built for publication: Inexact feasibility pump for mixed integer nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344569)