The transportation problem with exclusionary side constraints and two branch-and-bound algorithms (Q1848594)
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: The transportation problem with exclusionary side constraints and two branch-and-bound algorithms |
scientific article; zbMATH DE number 1827391
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The transportation problem with exclusionary side constraints and two branch-and-bound algorithms |
scientific article; zbMATH DE number 1827391 |
Statements
The transportation problem with exclusionary side constraints and two branch-and-bound algorithms (English)
0 references
13 November 2002
0 references
network flows
0 references
integer programming
0 references
transportation
0 references
branch-and-bound
0 references
logistics
0 references
0 references
0 references
0 references
0 references
0 references
