A note on the complexity of the transportation problem with a permutable demand vector (Q1806274)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on the complexity of the transportation problem with a permutable demand vector |
scientific article; zbMATH DE number 1356499
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the complexity of the transportation problem with a permutable demand vector |
scientific article; zbMATH DE number 1356499 |
Statements
A note on the complexity of the transportation problem with a permutable demand vector (English)
0 references
3 September 2001
0 references
transportation problem
0 references
permutable demand vector
0 references
computational complexity
0 references
minimum weight \(f\)-factor problem
0 references
0.8815996050834656
0 references
0.7655074596405029
0 references
0.7632695436477661
0 references
0.746442437171936
0 references
