Pages that link to "Item:Q4086967"

The following pages link to On the foundations of linear and integer linear programming I (Q4086967):

Displaying 50 items.

• Lower bounds on the graver complexity of \(M\)-fold matrices (Q259721) (← links)
• Quadratic diameter bounds for dual network flow polyhedra (Q312672) (← links)
• A polynomial oracle-time algorithm for convex integer minimization (Q623465) (← links)
• \(N\)-fold integer programming and nonlinear multi-transshipment (Q628649) (← links)
• The Graver complexity of integer programming (Q659795) (← links)
• Non-standard approaches to integer programming (Q697562) (← links)
• Optimality criterion for a class of nonlinear integer programs. (Q703262) (← links)
• Cone superadditivity of discrete convex functions (Q715073) (← links)
• Constructive characterizations of the value-function of a mixed-integer program. I (Q798260) (← links)
• Computing generating sets of lattice ideals and Markov bases of lattices (Q840713) (← links)
• Markov bases and generalized Lawrence liftings (Q891951) (← links)
• \(N\)-fold integer programming (Q951095) (← links)
• On test sets for nonlinear integer maximization (Q1003492) (← links)
• On the Gröbner complexity of matrices (Q1017673) (← links)
• Convex integer maximization via Graver bases (Q1017675) (← links)
• Standard pairs and group relaxations in integer programming (Q1295785) (← links)
• Test sets of integer programs (Q1298753) (← links)
• Test sets for integer programs (Q1365062) (← links)
• The fiber dimension of a graph (Q1618232) (← links)
• Bouquet algebra of toric ideals (Q1655816) (← links)
• Solving MIPs via scaling-based augmentation (Q1662107) (← links)
• Minimal resolutions of lattice ideals and integer linear programming (Q1884028) (← links)
• The quadratic Graver cone, quadratic integer minimization, and extensions (Q1925790) (← links)
• \(n\)-fold integer programming in cubic time (Q1942262) (← links)
• Decomposition of modular codes for computing test sets and Graver basis (Q1949046) (← links)
• A note on the approximability of deepest-descent circuit steps (Q2060534) (← links)
• A polyhedral model for enumeration and optimization over the set of circuits (Q2064285) (← links)
• About the complexity of two-stage stochastic IPs (Q2118129) (← links)
• An implementation of steepest-descent augmentation for linear programs (Q2183215) (← links)
• Graver basis and proximity techniques for block-structured separable convex integer minimization problems (Q2248743) (← links)
• Alternatives for testing total dual integrality (Q2429472) (← links)
• Vector and matrix apportionment problems and separable convex integer optimization (Q2482690) (← links)
• Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach (Q2502202) (← links)
• When is rounding allowed in integer nonlinear optimization? (Q2514870) (← links)
• Circuit walks in integral polyhedra (Q2673232) (← links)
• On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond (Q3457191) (← links)
• Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights (Q3565463) (← links)
• Sensitivity theorems in integer linear programming (Q3793940) (← links)
• The value function of an integer program (Q3941194) (← links)
• Coarse-grained entanglement classification through orthogonal arrays (Q4583103) (← links)
• Geometry of the Minimal Solutions of a Linear Diophantine Equation (Q4959654) (← links)
• Faster Algorithms for Integer Programs with Block Structure (Q5002724) (← links)
• About the Complexity of Two-Stage Stochastic IPs (Q5041750) (← links)
• Constructing Clustering Transformations (Q5150815) (← links)
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
• (Q5874501) (← links)
• New Bounds for the Integer Carathéodory Rank (Q6136661) (← links)
• Higher-dimensional sieving for the number field sieve algorithms (Q6165871) (← links)
• Circuits in extended formulations (Q6564188) (← links)
• Equivariant lattice bases (Q6582248) (← links)