Feasible rounding approaches for equality constrained mixed-integer optimization problems
From MaRDI portal
Publication:5880390
DOI10.1080/02331934.2021.1981894MaRDI QIDQ5880390
Oliver Stein, Christoph Neumann
Publication date: 9 March 2023
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2021.1981894
Related Items
Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization
Uses Software
Cites Work
- Cutting planes from a mixed integer Farkas lemma.
- Bounds on the objective value of feasible roundings
- Granularity in nonlinear mixed-integer optimization
- A feasible rounding approach for mixed-integer optimization problems
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts