A branch-and-cut algorithm for capacitated network design problems (Q1806022): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q202051 |
Normalize DOI. |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s101070050077 / rank | |||
| Property / author | |||
| Property / author: Oktay Günlük / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Concorde / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s101070050077 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2010440802 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S101070050077 / rank | |||
Normal rank | |||
Latest revision as of 09:39, 16 December 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
