Publication:4252434
From MaRDI portal
zbMath1052.90589MaRDI QIDQ4252434
Andreas S. Schulz, Robert Weismantel
Publication date: 1999
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)
Related Items
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond, Analyzing the complexity of finding good neighborhood functions for local search algorithms, On circuit diameter bounds via circuit imbalances, A polynomial oracle-time algorithm for convex integer minimization, 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
