Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205)
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-cut approaches for chance-constrained formulations of reliable network design problems |
scientific article; zbMATH DE number 6351712
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-and-cut approaches for chance-constrained formulations of reliable network design problems |
scientific article; zbMATH DE number 6351712 |
Statements
Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (English)
0 references
6 October 2014
0 references
reliable network design
0 references
chance constraints
0 references
integer programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8618297576904297
0 references
0.8114983439445496
0 references
0.8111201524734497
0 references
0.7942337393760681
0 references
0.758216381072998
0 references
