Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem (Q1016064): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:40, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem |
scientific article |
Statements
Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem (English)
0 references
4 May 2009
0 references
nonconvex optimization
0 references
branch-and-price-and-cut
0 references
network optimization
0 references
reliability
0 references
