A branch and cut algorithm for hub location problems with single assignment (Q1771311)
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 branch and cut algorithm for hub location problems with single assignment |
scientific article; zbMATH DE number 2159481
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and cut algorithm for hub location problems with single assignment |
scientific article; zbMATH DE number 2159481 |
Statements
A branch and cut algorithm for hub location problems with single assignment (English)
0 references
19 April 2005
0 references
Hub location
0 references
Polyhedral analysis
0 references
Branch and cut
0 references
0 references
