Sensitivity theorems in integer linear programming
From MaRDI portal
Publication:3793940
DOI10.1007/BF01582230zbMath0648.90055MaRDI QIDQ3793940
Éva Tardos, A. M. H. Gerards, William Cook, Alexander Schrijver
Publication date: 1986
Published in: Mathematical Programming (Search for Journal in Brave)
Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)
Related Items
Multiple cost coefficients sensitivity theorems of integer linear optimization, Geometric random edge, The Integrality Number of an Integer Program, Tightness of sensitivity and proximity bounds for integer linear programs, Error bounds for analytic systems and their applications, Error bounds for mixed integer nonlinear optimization problems, Proximity in concave integer quadratic programming, Refined proximity and sensitivity results in linearly constrained convex separable integer programming, Parametric methods in integer linear programming, Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures, Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers, Error estimates and Lipschitz constants for best approximation in continuous function spaces, Error bounds in mathematical programming, On lattice point counting in \(\varDelta\)-modular polyhedra, Improving the Cook et al. proximity bound given integral valued constraints, On circuit diameter bounds via circuit imbalances, A closed-form representation of mixed-integer program value functions, The Gap Function: Evaluating Integer Programming Models over Multiple Right-Hand Sides, Subspaces with well-scaled frames, The height of minimal Hilbert bases, On cutting-plane proofs in combinatorial optimization, Error bounds for solutions of linear equations and inequalities, An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem, A note of Lipschitz constants for solutions of linear inequalities and equations, Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids, Convex approximations for two-stage mixed-integer mean-risk recourse models with conditional value-at-risk, Distances to lattice points in knapsack polyhedra, A colorful Steinitz lemma with application to block-structured integer programs, Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube, Online minimization of the maximum starting time: migration helps, On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems, Two-stage quadratic integer programs with stochastic right-hand sides, Facet Generating Techniques, The Distributions of Functions Related to Parametric Integer Optimization, Two sensitivity theorems in fuzzy integer programming., Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function, On the Chvátal rank of polytopes in the 0/1 cube, Monotonizing linear programs with up to two nonzeroes per column, The relationship between integer and real solutions of constrained convex programming, Continuity and stability of fully random two-stage stochastic programs with mixed-integer recourse, Distance-Sparsity Transference for Vertices of Corner Polyhedra, Quantitative stability of fully random mixed-integer two-stage stochastic programs, The distance to a polyhedron, On matrices with the Edmonds-Johnson property arising from bidirected graphs, Lattice translates of a polytope and the Frobenius problem, FPT-algorithms for some problems related to integer programming, Rounding on the standard simplex: regular grids for global optimization, Two strongly polynomial cut cancelling algorithms for minimum cost network flow, Non-standard approaches to integer programming, A Convex Approximation for Two-Stage Mixed-Integer Recourse Models with a Uniform Error Bound, Strong IP formulations need large coefficients, On the relationship between the integer and continuous solutions of convex programs, On the complexity of cutting-plane proofs, Distances between optimal solutions of mixed-integer programs, Inverse integer optimization with multiple observations, Rational polyhedral outer-approximations of the second-order cone, Proximity bounds for random integer programs, On Proximity for k-Regular Mixed-Integer Linear Optimization, Proximity bounds for random integer programs, The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program, Existence of equilibria in a decentralized two-level supply chain, Some proximity and sensitivity results in quadratic integer programming, Pseudo-Valid Cutting Planes for Two-Stage Mixed-Integer Stochastic Programs with Right-Hand-Side Uncertainty, Polyhedral techniques in combinatorial optimization I: Theory, Analyse de sensibilité pour les problèmes linéaires en variables 0-1, New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems, A Robust AFPTAS for Online Bin Packing with Polynomial Migration, Parametric error bounds for convex approximations of two-stage mixed-integer recourse models with a random second-stage cost vector, Standard pairs and group relaxations in integer programming, Error bounds for mixed integer linear optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of cutting-plane proofs
- Total dual integrality and integer polyhedra
- Matrices with the Edmonds-Johnson property
- The b-hull of an integer program
- On total dual integrality
- The value function of a mixed integer program: I
- The value function of a mixed integer program. II
- Some polyhedra related to combinatorial problems
- Edmonds polytopes and a hierarchy of combinatorial problems
- Facet Generating Techniques
- Integer Programming with a Fixed Number of Variables
- On Cutting Planes
- The value function of an integer program
- On the foundations of linear and integer linear programming I
- A Bound on Solutions of Linear Integer Equalities and Inequalities
- On Linear Characterizations of Combinatorial Optimization Problems
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- Edmonds polytopes and weakly hamiltonian graphs
