Combinatoric classes of the transportation problem and their properties
From MaRDI portal
Recommendations
Cites work
- A network simplex method
- Degeneracy in transportation problems
- Faces of dual transportation polyhedra
- scientific article; zbMATH DE number 3630478 (Why is no real title available?)
- New Finite Pivoting Rules for the Simplex Method
- Optimality and Degeneracy in Linear Programming
- Perron eigenvectors and the symmetric transportation polytope
- Some NP-complete problems in linear programming
- The assignment game. I: The core
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- The Hirsch Conjecture for Dual Transportation Polyhedra
- Theoretical Properties of the Network Simplex Method
- Transportation polytopes
Cited in
(8)- On a transport problem and monoids of non-negative integers
- A new transportation problem on a graph with sending and bringing-back operations
- On the Owen set of transportation situations
- scientific article; zbMATH DE number 5911945 (Why is no real title available?)
- scientific article; zbMATH DE number 3843498 (Why is no real title available?)
- scientific article; zbMATH DE number 5524337 (Why is no real title available?)
- Topics of polyhedral combinatorics in transportation problems with exclusions
- Combinatorial problems related to origin-destination matrices.
This page was built for publication: Combinatoric classes of the transportation problem and their properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1312755)