A branch-and-cut algorithm for capacitated network design problems (Q1806022): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q202051 |
||
| Property / author | |||
| Property / author: Oktay Günlük / rank | |||
Revision as of 20:03, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for capacitated network design problems |
scientific article |
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
