\(N\)-fold integer programming and nonlinear multi-transshipment

DOI10.1007/s11590-010-0231-9zbMath1213.90180arXiv0903.4577OpenAlexW2040148572MaRDI QIDQ628649

Raymond Hemmecke, Robert Weismantel, Shmuel Onn

Publication date: 14 March 2011

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0903.4577

zbMATH Keywords

convex optimizationnonlinear optimizationtransportation problemmulticommodity flowgraver basis\(N\)-fold product

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items

Using inverse optimization to learn cost functions in generalized Nash games, Computing equilibria for integer programming games, The quadratic Graver cone, quadratic integer minimization, and extensions, \(n\)-fold integer programming in cubic time, Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• A polynomial oracle-time algorithm for convex integer minimization
• The Graver complexity of integer programming
• A finiteness theorem for Markov bases of hierarchical models
• \(N\)-fold integer programming
• Convex integer maximization via Graver bases
• Higher Lawrence configurations.
• Markov bases of three-way tables are arbitrarily complicated
• Integer Programming with a Fixed Number of Variables
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
• On the foundations of linear and integer linear programming I
• The Complexity of Three-Way Statistical Tables
• Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
• All Linear and Integer Programs Are Slim 3‐Way Transportation Programs