All Linear and Integer Programs Are Slim 3‐Way Transportation Programs
- 1 January 2006
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 17 (3), 806-821
- https://doi.org/10.1137/040610623
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Markov bases of three-way tables are arbitrarily complicatedJournal of Symbolic Computation, 2005
- The Complexity of Three-Way Statistical TablesSIAM Journal on Computing, 2004
- On properties of multi-dimensional statistical tablesJournal of Statistical Planning and Inference, 2003
- Gröbner Bases and Polyhedral Geometry of Reducible and Cyclic ModelsJournal of Combinatorial Theory, Series A, 2002
- The Stable Allocation (or Ordinal Transportation) ProblemMathematics of Operations Research, 2002
- Approximating Fractional Multicommodity Flow Independent of the Number of CommoditiesSIAM Journal on Discrete Mathematics, 2000
- Clique is hard to approximate within n1−εActa Mathematica, 1999
- Signature classes of transportation polytopesMathematical Programming, 1993
- A Graph Theoretic Approach to Statistical Data SecuritySIAM Journal on Computing, 1988
- Multi-Commodity Network FlowsOperations Research, 1963