The transportation problem with exclusionary side constraints and two branch-and-bound algorithms (Q1848594): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q57570768, #quickstatements; #temporary_batch_1703768564763 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57570768 / rank | |||
Normal rank | |||
Revision as of 15:07, 28 December 2023
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
