On the positive sums property and the computation of Graver test sets

DOI10.1007/s10107-003-0385-7zbMath1059.90108OpenAlexW1987493955MaRDI QIDQ1424269

Raymond Hemmecke

Publication date: 11 March 2004

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-003-0385-7

zbMATH Keywords

mixed integer programmingaugmentation algorithmGraver test setspositive sum property

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items

Computing generating sets of lattice ideals and Markov bases of lattices, On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond, Real-valued group testing for quantitative molecular assays, A polynomial oracle-time algorithm for convex integer minimization, On the Circuit Diameter of Some Combinatorial Polytopes, \(N\)-fold integer programming, Graver basis and proximity techniques for block-structured separable convex integer minimization problems, Support sets in exponential families and oriented matroid theory, 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