Branch-and-cut methods for the network design problem with vulnerability constraints (Q1652559): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2017.10.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2765289774 / rank | |||
Normal rank | |||
Revision as of 01:36, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-and-cut methods for the network design problem with vulnerability constraints |
scientific article |
Statements
Branch-and-cut methods for the network design problem with vulnerability constraints (English)
0 references
11 July 2018
0 references
networks
0 references
integer programming
0 references
survivable network design
0 references
hop-constraints
0 references
OR in telecommunications
0 references
Benders decomposition
0 references
