Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: LEMON / rank | |||
Normal rank | |||
Revision as of 20:37, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-and-cut approaches for chance-constrained formulations of reliable network design problems |
scientific article |
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
