A branch and cut algorithm for hub location problems with single assignment (Q1771311): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: ABACUS / rank | |||
Normal rank | |||
Revision as of 13:12, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and cut algorithm for hub location problems with single assignment |
scientific article |
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
