Degeneracy in transportation problems (Q1082263): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The alternating basis algorithm for assignment problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Transportation polytopes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some NP-complete problems in linear programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A network simplex method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Theoretical Properties of the Network Simplex Method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3844775 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Degeneracy in transportation problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5576685 / rank | |||
Normal rank |
Revision as of 15:24, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Degeneracy in transportation problems |
scientific article |
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