The transportation problem with exclusionary side constraints and two branch-and-bound algorithms (Q1848594): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CPLEX / rank | |||
Normal rank | |||
Revision as of 09:20, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The transportation problem with exclusionary side constraints and two branch-and-bound algorithms |
scientific article |
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
