Experimental comparisons of codes for long transportation problems
From MaRDI portal
(Redirected from Publication:1086155)
The main purpose of this note is to discuss a new approach for solving the L.P. Transportation Problem, which can be formulated as follows: \[ \min imize\quad \sum C_{ij}X_{ij}\quad subject\quad to\quad \sum_{i}X_{ij}b_ j\sum_{j}X_{ij}=a_ i;\quad X_{ij}\geq 0,\quad 1\leq i\leq m;\quad 1\leq j\leq n. \] The experiments presented here show that this approach is superior, at least for problems with \(m\ll n\).
Recommendations
Cites work
- A Code for the Transportation Problem of Linear Programming
- A method for the solution of transportation problems with tall matrices
- Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
- Coding the transportation problem
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3573250 (Why is no real title available?)
- scientific article; zbMATH DE number 3276188 (Why is no real title available?)
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
- On the use of tree indexing methods in transportation algorithms
- Technical Note—A Special Case of the Transportation Problem
- The assignment problem with three job categories
Cited in
(3)
This page was built for publication: Experimental comparisons of codes for long transportation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086155)
