Bounds on the objective value of feasible roundings
From MaRDI portal
Publication:2189630
DOI10.1007/s10013-020-00393-4zbMath1440.90032OpenAlexW3011808692MaRDI QIDQ2189630
Christoph Neumann, Nathan Sudermann-Merx, Oliver Stein
Publication date: 16 June 2020
Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10013-020-00393-4
Integer programming (90C10) Mixed integer programming (90C11) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)
Related Items (3)
Feasible rounding approaches for equality constrained mixed-integer optimization problems ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Error bounds for mixed integer linear optimization problems
- Error bounds for mixed integer nonlinear optimization problems
- New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
- Error bounds for analytic systems and their applications
- Error bounds in mathematical programming
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Where are the hard knapsack problems?
- Global error bounds for piecewise convex polynomials
- Granularity in nonlinear mixed-integer optimization
- A feasible rounding approach for mixed-integer optimization problems
- Stability of Error Bounds for Semi-infinite Convex Constraint Systems
- Computable Error Bounds For Convex Inequality Systems In Reflexive Banach Spaces
- A Condition Number for Differentiable Convex Inequalities
- Global Regularity Theorems
- An Application of Error Bounds for Convex Programming in a Linear Space
- Extension of Hoffman’s Error Bound to Polynomial Systems
- A survey on error bounds for lower semicontinuous functions
- Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
- Approximations to Solutions to Systems of Linear Inequalities
- Discrete-Variable Extremum Problems
This page was built for publication: Bounds on the objective value of feasible roundings