Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem (Q1016064)
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: Branch-and-price-and-cut algorithms for solving the reliable h-paths problem |
scientific article; zbMATH DE number 5550495
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem |
scientific article; zbMATH DE number 5550495 |
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
0 references
0 references
0 references
0 references
0.8360360264778137
0 references
0.8114983439445496
0 references
0.7876126766204834
0 references
0.7867445945739746
0 references
0.7794961929321289
0 references
