Error bounds for mixed integer nonlinear optimization problems
From MaRDI portal
Publication:315475
DOI10.1007/s11590-016-1011-yzbMath1377.90061OpenAlexW2258633420MaRDI QIDQ315475
Publication date: 21 September 2016
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-016-1011-y
Related Items
The Gap Function: Evaluating Integer Programming Models over Multiple Right-Hand Sides ⋮ A feasible rounding approach for mixed-integer optimization problems ⋮ Bounds on the objective value of feasible roundings ⋮ Approximation Properties and Tight Bounds for Constrained Mixed-Integer Optimal Control ⋮ Generating Feasible Points for Mixed-Integer Convex Optimization Problems by Inner Parallel Cuts ⋮ Granularity in nonlinear mixed-integer optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Global error bounds for piecewise convex polynomials
- Stability of Error Bounds for Semi-infinite Convex Constraint Systems
- Computable Error Bounds For Convex Inequality Systems In Reflexive Banach Spaces
- 50 Years of Integer Programming 1958-2008
- Integer Rounding for Polymatroid and Branching Optimization Problems
- A Condition Number for Differentiable Convex Inequalities
- Sensitivity theorems in integer linear programming
- Global Regularity Theorems
- Interval Methods for Systems of Equations
- 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
This page was built for publication: Error bounds for mixed integer nonlinear optimization problems