A feasible rounding approach for mixed-integer optimization problems
From MaRDI portal
Publication:2419508
DOI10.1007/s10589-018-0042-yzbMath1414.90239OpenAlexW2899062086WikidataQ129076147 ScholiaQ129076147MaRDI QIDQ2419508
Oliver Stein, Nathan Sudermann-Merx, Christoph Neumann
Publication date: 13 June 2019
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-018-0042-y
Related Items
Feasible rounding approaches for equality constrained mixed-integer optimization problems ⋮ Bounds on the objective value of feasible roundings ⋮ Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization ⋮ Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts ⋮ Granularity in nonlinear mixed-integer optimization
Uses Software
Cites Work
- Unnamed Item
- Error bounds for mixed integer linear optimization problems
- Error bounds for mixed integer nonlinear optimization problems
- Heuristics for convex mixed integer nonlinear programs
- Boosting the feasibility pump
- RENS. The optimal rounding
- Feasibility pump 2.0
- Rounding-based heuristics for nonconvex MINLPS
- Granularity in nonlinear mixed-integer optimization
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- MIPLIB 2003
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- The feasibility pump
- Integer Programming
- Presolve Reductions in Mixed Integer Programming
- Integer Rounding for Polymatroid and Branching Optimization Problems
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Mixed-integer nonlinear optimization
- Efficient Heuristic Procedures for Integer Linear Programming with an Interior
