Sensitivity theorems in integer linear programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3904333
- Multiple cost coefficients sensitivity theorems of integer linear optimization
- Tightness of sensitivity and proximity bounds for integer linear programs
- Two sensitivity theorems in fuzzy integer programming.
- Some proximity and sensitivity results in quadratic integer programming
Cites work
- scientific article; zbMATH DE number 3858857 (Why is no real title available?)
- scientific article; zbMATH DE number 3860890 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3797486 (Why is no real title available?)
- scientific article; zbMATH DE number 3323651 (Why is no real title available?)
- scientific article; zbMATH DE number 3373541 (Why is no real title available?)
- scientific article; zbMATH DE number 3409134 (Why is no real title available?)
- A Bound on Solutions of Linear Integer Equalities and Inequalities
- Edmonds polytopes and a hierarchy of combinatorial problems
- Edmonds polytopes and weakly hamiltonian graphs
- Facet generating techniques
- Integer Programming with a Fixed Number of Variables
- Matrices with the Edmonds-Johnson property
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- On Cutting Planes
- On Linear Characterizations of Combinatorial Optimization Problems
- On the complexity of cutting-plane proofs
- On the foundations of linear and integer linear programming I
- On total dual integrality
- Some polyhedra related to combinatorial problems
- The b-hull of an integer program
- The value function of a mixed integer program. II
- The value function of a mixed integer program: I
- The value function of an integer program
- Total dual integrality and integer polyhedra
Cited in
(87)- On Proximity for k-Regular Mixed-Integer Linear Optimization
- Error bounds for solutions of linear equations and inequalities
- Parametric methods in integer linear programming
- Error bounds for mixed integer linear optimization problems
- Tightness of sensitivity and proximity bounds for integer linear programs
- Error estimates and Lipschitz constants for best approximation in continuous function spaces
- Non-linear integer programming: Sensitivity analysis for branch and bound
- Non-standard approaches to integer programming
- On circuit diameter bounds via circuit imbalances
- Rounding on the standard simplex: regular grids for global optimization
- The distributions of functions related to parametric integer optimization
- A Convex Approximation for Two-Stage Mixed-Integer Recourse Models with a Uniform Error Bound
- Pseudo-valid cutting planes for two-stage mixed-integer stochastic programs with right-hand-side uncertainty
- Some proximity and sensitivity results in quadratic integer programming
- Solving stochastic and bilevel mixed-integer programs via a generalized value function
- A note of Lipschitz constants for solutions of linear inequalities and equations
- Sensitivity analysis for mixed binary quadratic programming
- Sparsity and integrality gap transference bounds for integer programs
- On matrices with the Edmonds-Johnson property arising from bidirected graphs
- Existence of equilibria in a decentralized two-level supply chain
- The distance to a polyhedron
- On cutting-plane proofs in combinatorial optimization
- Sensitivity analysis for mixed binary quadratic programming
- Two sensitivity theorems in fuzzy integer programming.
- Online minimization of the maximum starting time: migration helps
- The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program
- Strong IP formulations need large coefficients
- Two-stage quadratic integer programs with stochastic right-hand sides
- FPT-algorithms for some problems related to integer programming
- Error bounds for analytic systems and their applications
- Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures
- A robust AFPTAS for online bin packing with polynomial migration
- Error bounds in mathematical programming
- The height of minimal Hilbert bases
- On the Chvátal rank of polytopes in the 0/1 cube
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems
- Subspaces with well-scaled frames
- The gap function: evaluating integer programming models over multiple right-hand sides
- Distances to lattice points in knapsack polyhedra
- On the complexity of cutting-plane proofs
- Sensitivity analysis for convex separable optimization over integral polymatroids
- Integer programs with bounded subdeterminants and two nonzeros per row
- scientific article; zbMATH DE number 764459 (Why is no real title available?)
- Distances between optimal solutions of mixed-integer programs
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow
- Polyhedral techniques in combinatorial optimization I: Theory
- Error bounds for mixed integer nonlinear optimization problems
- Proximity in concave integer quadratic programming
- On circuit diameter bounds via circuit imbalances
- An efficient quantifier elimination procedure for Presburger arithmetic
- Sparsity and proximity transference in integer programming
- Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers
- Rational polyhedral outer-approximations of the second-order cone
- On lattice point counting in -modular polyhedra
- The Integrality Number of an Integer Program
- On the relationship between the integer and continuous solutions of convex programs
- scientific article; zbMATH DE number 4035567 (Why is no real title available?)
- Continuity and stability of fully random two-stage stochastic programs with mixed-integer recourse
- Facet generating techniques
- Improving the Cook et al. proximity bound given integral valued constraints
- Robust scheduling on uniform machines. New results using a relaxed approximation guarantee
- Lattice translates of a polytope and the Frobenius problem
- The relationship between integer and real solutions of constrained convex programming
- Inverse integer optimization with multiple observations
- Minimizing a Low-Dimensional Convex Function Over a High-Dimensional Cube
- Multiple cost coefficients sensitivity theorems of integer linear optimization
- No polynomial kernels for knapsack
- On -modular integer linear problems in the canonical form and equivalent problems
- An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem
- Totally -modular IPs with two non-zeros in most rows
- Quantitative stability of fully random mixed-integer two-stage stochastic programs
- Standard pairs and group relaxations in integer programming
- Geometric random edge
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
- Stability of maximal generating degrees of powers of monomial ideals
- Proximity bounds for random integer programs
- Proximity bounds for random integer programs
- Monotonizing linear programs with up to two nonzeroes per column
- Distance-sparsity transference for vertices of corner polyhedra
- Refined proximity and sensitivity results in linearly constrained convex separable integer programming
- scientific article; zbMATH DE number 3904333 (Why is no real title available?)
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1
- Parametric error bounds for convex approximations of two-stage mixed-integer recourse models with a random second-stage cost vector
- Zero-one laws for random feasibility problems
- Convex approximations for two-stage mixed-integer mean-risk recourse models with conditional value-at-risk
- A closed-form representation of mixed-integer program value functions
- A colorful Steinitz lemma with application to block-structured integer programs
This page was built for publication: Sensitivity theorems in integer linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3793940)
