Integer Programming and Combinatorial Optimization

DOI10.1007/B97946MaRDI QIDQ5712465zbMATH OpenOpenAlexFDO

Authors Jesús A. De Loera, Shmuel Onn

Publication date 23 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b97946

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• All Linear and Integer Programs Are Slim 3‐Way Transportation Programs
• The Complexity of Three-Way Statistical Tables
• Small Contingency Tables with Large Gaps
• Compressed polytopes and statistical disclosure limitation
• scientific article; zbMATH DE number 3904323

Cited in

(9)

• Markov bases of three-way tables are arbitrarily complicated
• Toric fiber products
• Polyhedral combinatorics of multi-index axial transportation problems
• On multi-index assignment polytopes
• Permutohedra and minimal matrices
• Block-structured integer programming: can we parameterize without the largest coefficient?
• All Linear and Integer Programs Are Slim 3‐Way Transportation Programs
• Compressed polytopes and statistical disclosure limitation
• \(N\)-fold integer programming

This page was built for publication: Integer Programming and Combinatorial Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712465)