On the foundations of linear and integer linear programming I
From MaRDI portal
Cites work
Cited in
(56)- On test sets for nonlinear integer maximization
- On the Gröbner complexity of matrices
- Convex integer maximization via Graver bases
- Standard pairs and group relaxations in integer programming
- Test sets of integer programs
- Test sets for integer programs
- The fiber dimension of a graph
- Bouquet algebra of toric ideals
- Solving MIPs via scaling-based augmentation
- Minimal resolutions of lattice ideals and integer linear programming
- The quadratic Graver cone, quadratic integer minimization, and extensions
- \(n\)-fold integer programming in cubic time
- Decomposition of modular codes for computing test sets and Graver basis
- A note on the approximability of deepest-descent circuit steps
- A polyhedral model for enumeration and optimization over the set of circuits
- About the complexity of two-stage stochastic IPs
- An implementation of steepest-descent augmentation for linear programs
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems
- Alternatives for testing total dual integrality
- Vector and matrix apportionment problems and separable convex integer optimization
- Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
- When is rounding allowed in integer nonlinear optimization?
- Lower bounds on the graver complexity of M-fold matrices
- Circuit walks in integral polyhedra
- Quadratic diameter bounds for dual network flow polyhedra
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
- Two-stage stochastic mixed-integer programs: algorithms and insights
- Sensitivity theorems in integer linear programming
- The value function of an integer program
- Coarse-grained entanglement classification through orthogonal arrays
- Geometry of the Minimal Solutions of a Linear Diophantine Equation
- Faster Algorithms for Integer Programs with Block Structure
- About the Complexity of Two-Stage Stochastic IPs
- Constructing Clustering Transformations
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- scientific article; zbMATH DE number 7651172 (Why is no real title available?)
- New Bounds for the Integer Carathéodory Rank
- Higher-dimensional sieving for the number field sieve algorithms
- A polynomial oracle-time algorithm for convex integer minimization
- \(N\)-fold integer programming and nonlinear multi-transshipment
- Circuits in extended formulations
- Equivariant lattice bases
- The Graver complexity of integer programming
- FPT algorithms for a special block-structured integer program with applications in scheduling
- (Near)-optimal algorithms for sparse separable convex integer programs
- Augmentation search for integer programming over a polyhedron
- Non-standard approaches to integer programming
- On combinatorial network flows algorithms and circuit augmentation for pseudoflows
- On the hardness of short and sign-compatible circuit walks
- Optimality criterion for a class of nonlinear integer programs.
- Cone superadditivity of discrete convex functions
- On the circuit diameter conjecture for counterexamples to the Hirsch conjecture
- Constructive characterizations of the value-function of a mixed-integer program. I
- Computing generating sets of lattice ideals and Markov bases of lattices
- Markov bases and generalized Lawrence liftings
- \(N\)-fold integer programming
This page was built for publication: On the foundations of linear and integer linear programming I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4086967)
