Degeneracy in transportation problems (Q1082263)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3972630
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Degeneracy in transportation problems |
scientific article; zbMATH DE number 3972630 |
Statements
Degeneracy in transportation problems (English)
0 references
1986
0 references
The paper provides a systematic study of degeneracy as it appears in transportation problems. First the relationship between the degeneracy and the geometry of a transportation polytope is dicussed. Formulae for the minimum and maximum number of vertices are given. This part presents some new results. In the succeeding discussion the authors develop the basis of a procedure for generating transportation problems with various degree of degeneracy. Two such families of problems were solved using the program GNET (a general purpose transshipment problem solver). Interesting computational experiences and conclusions are also presented.
0 references
degeneracy
0 references
transportation
0 references
minimum and maximum number of vertices
0 references
general purpose transshipment problem solver
0 references
computational experiences
0 references
0 references
0.8084276914596558
0 references
0.8021563291549683
0 references
0.7885002493858337
0 references
