A branch-and-cut algorithm for capacitated network design problems (Q1806022)
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 capacitated network design problems |
scientific article; zbMATH DE number 1356207
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for capacitated network design problems |
scientific article; zbMATH DE number 1356207 |
Statements
A branch-and-cut algorithm for capacitated network design problems (English)
0 references
1999
0 references
capacity expansion problem
0 references
network loading problem
0 references
bi-directional edge capacities
0 references
knapsack branching
0 references
branch-and-cut algorithm
0 references
capacitated network design
0 references
point-to-point traffic demands
0 references
mixed-integer programming
0 references
0.9401494
0 references
0.92982167
0 references
0.9218383
0 references
0.9204137
0 references
0.9166136
0 references
0.90888673
0 references
