Error bounds for mixed integer linear optimization problems
From MaRDI portal
Publication:263186
DOI10.1007/s10107-015-0872-7zbMath1345.90061OpenAlexW2153223311MaRDI QIDQ263186
Publication date: 4 April 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-015-0872-7
Integer programming (90C10) Mixed integer programming (90C11) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)
Related Items (7)
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 ⋮ New characterizations of Hoffman constants for systems of linear constraints ⋮ Granularity in nonlinear mixed-integer optimization
Cites Work
- Testing additive integrality gaps
- New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
- Some proximity and sensitivity results in quadratic integer programming
- The distance to a polyhedron
- Geometric algorithms and combinatorial optimization
- The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program
- Error bounds for analytic systems and their applications
- Global error bounds for piecewise convex polynomials
- 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
- An Application of Error Bounds for Convex Programming in a Linear Space
- Sharp Lipschitz Constants for Basic Optimal Solutions and Basic Feasible Solutions of Linear Programs
- Extension of Hoffman’s Error Bound to Polynomial Systems
- Sharp Estimates for Hoffman's Constant for Systems of Linear Inequalities and Equalities
- Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
- Approximations to Solutions to Systems of Linear Inequalities
- Error bounds for solutions of linear equations and inequalities
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Error bounds for mixed integer linear optimization problems
