A branch‐and‐cut algorithm for hub network design problems with profits (Q6051584)
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 network design problems with profits |
scientific article; zbMATH DE number 7752643
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch‐and‐cut algorithm for hub network design problems with profits |
scientific article; zbMATH DE number 7752643 |
Statements
A branch‐and‐cut algorithm for hub network design problems with profits (English)
0 references
20 October 2023
0 references
Benders decomposition
0 references
branch-and-cut algorithm
0 references
hub network design problems with profits
0 references
mixed integer linear programming
0 references
0 references
0 references
