Network interdiction via a critical disruption path: branch-and-price algorithms (Q336604)
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: Network interdiction via a critical disruption path: branch-and-price algorithms |
scientific article; zbMATH DE number 6650507
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Network interdiction via a critical disruption path: branch-and-price algorithms |
scientific article; zbMATH DE number 6650507 |
Statements
Network interdiction via a critical disruption path: branch-and-price algorithms (English)
0 references
10 November 2016
0 references
network interdiction
0 references
mixed-integer linear programming
0 references
NP-completeness
0 references
branch-and-price
0 references
cuts
0 references
0 references
0.8370628952980042
0 references
0.7919260263442993
0 references
0.7844469547271729
0 references
0.783566415309906
0 references
0.7731122374534607
0 references
