On the foundations of linear and integer linear programming I
From MaRDI portal
Publication:4086967
DOI10.1007/BF01681344zbMath0323.90035OpenAlexW2083860925MaRDI QIDQ4086967
Publication date: 1975
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01681344
Related Items (48)
The fiber dimension of a graph ⋮ About the Complexity of Two-Stage Stochastic IPs ⋮ Minimal resolutions of lattice ideals and integer linear programming ⋮ Computing generating sets of lattice ideals and Markov bases of lattices ⋮ Quadratic diameter bounds for dual network flow polyhedra ⋮ On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond ⋮ Test sets for integer programs ⋮ Bouquet algebra of toric ideals ⋮ Solving MIPs via scaling-based augmentation ⋮ The quadratic Graver cone, quadratic integer minimization, and extensions ⋮ Coarse-grained entanglement classification through orthogonal arrays ⋮ An implementation of steepest-descent augmentation for linear programs ⋮ Circuit walks in integral polyhedra ⋮ Markov bases and generalized Lawrence liftings ⋮ A polynomial oracle-time algorithm for convex integer minimization ⋮ New Bounds for the Integer Carathéodory Rank ⋮ \(n\)-fold integer programming in cubic time ⋮ \(N\)-fold integer programming and nonlinear multi-transshipment ⋮ Unnamed Item ⋮ Higher-dimensional sieving for the number field sieve algorithms ⋮ Alternatives for testing total dual integrality ⋮ Decomposition of modular codes for computing test sets and Graver basis ⋮ Sensitivity theorems in integer linear programming ⋮ The Graver complexity of integer programming ⋮ Faster Algorithms for Integer Programs with Block Structure ⋮ Constructing Clustering Transformations ⋮ \(N\)-fold integer programming ⋮ Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights ⋮ Graver basis and proximity techniques for block-structured separable convex integer minimization problems ⋮ Vector and matrix apportionment problems and separable convex integer optimization ⋮ Non-standard approaches to integer programming ⋮ Optimality criterion for a class of nonlinear integer programs. ⋮ Cone superadditivity of discrete convex functions ⋮ Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach ⋮ When is rounding allowed in integer nonlinear optimization? ⋮ On test sets for nonlinear integer maximization ⋮ Geometry of the Minimal Solutions of a Linear Diophantine Equation ⋮ On the Gröbner complexity of matrices ⋮ Convex integer maximization via Graver bases ⋮ A note on the approximability of deepest-descent circuit steps ⋮ A polyhedral model for enumeration and optimization over the set of circuits ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Standard pairs and group relaxations in integer programming ⋮ Test sets of integer programs ⋮ The value function of an integer program ⋮ Constructive characterizations of the value-function of a mixed-integer program. I ⋮ Lower bounds on the graver complexity of \(M\)-fold matrices ⋮ About the complexity of two-stage stochastic IPs
Cites Work
This page was built for publication: On the foundations of linear and integer linear programming I
