Polytopes, graphs and optimisation
Polytopes, graphs and optimisation
Theory of linear and integer programming
Theory of linear and integer programming
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
A faster strongly polynomial minimum cost flow algorithm
Operations Research
Computational Optimization and Applications
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An LP-based algorithm for the data association problem in multitarget tracking
Computers and Operations Research
Extracting pure network submatrices in linear programs using signed graphs
Discrete Applied Mathematics
Multiindex resource distributions for hierarchical systems
Automation and Remote Control
New lower bounds for the triplanar assignment problem. Use of the classical model
Automation and Remote Control
Graphs of transportation polytopes
Journal of Combinatorial Theory Series A
Three-Index linear programs with nested structure
Automation and Remote Control
| Hi-index | 0.00 |
We consider multiindex transportation problems of linear and integer linear programming. As a method of solving them, we propose an approach based on reductions of multiindex transportation problems to min-flow problems. We show that under the reduction scheme we consider, the 2-embeddability condition for multiindex problems is a necessary and sufficient condition for the problem to be reducible to a min-cost flow problem.