A Generalized Simplex Method for Integer Problems Given by Verification Oracles

DOI10.1137/16M1106936zbMath1461.90074OpenAlexW3132011969MaRDI QIDQ5853568

Sergei Chubanov

Publication date: 10 March 2021

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/16m1106936

zbMATH Keywords

linear programmingdualitysimplex methodnormal Fan

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05)

Related Items (1)

A scaling algorithm for optimizing arbitrary functions over vertices of polytopes

Cites Work

• Unnamed Item
• On the diameter of lattice polytopes
• On the shadow simplex method for curved polyhedra
• Triangulations. Structures for algorithms and applications
• The simplex method. A probabilistic analysis
• On the diameter of convex polytopes
• Improved bounds on the diameter of lattice polytopes
• The Hirsch conjecture is true for (0,1)-polytopes
• A polynomial algorithm for convex quadratic optimization subject to linear inequalities
• On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming
• Integer Programming: Optimization and Evaluation Are Equivalent
• On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
• The diameter of lattice zonotopes
• The Complexity of Generic Primal Algorithms for Solving General Integer Programs
• 0/1-Integer programming: Optimization and Augmentation are equivalent

This page was built for publication: A Generalized Simplex Method for Integer Problems Given by Verification Oracles