Network interdiction through length-bounded critical disruption paths: a bi-objective approach (Q325490): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (6 intermediate revisions by 6 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.endm.2016.03.049 / rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C11 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C29 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6640296 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
network interdiction | |||
| Property / zbMATH Keywords: network interdiction / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
multi-objective programming | |||
| Property / zbMATH Keywords: multi-objective programming / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
mixed integer linear programming | |||
| Property / zbMATH Keywords: mixed integer linear programming / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
critical disruption path | |||
| Property / zbMATH Keywords: critical disruption path / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
connected components | |||
| Property / zbMATH Keywords: connected components / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2396284287 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Network interdiction via a critical disruption path: branch-and-price algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity of the critical node problem over trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Exact interdiction models and algorithms for disconnecting networks via node deletions / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ENDM.2016.03.049 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 14:25, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Network interdiction through length-bounded critical disruption paths: a bi-objective approach |
scientific article |
Statements
Network interdiction through length-bounded critical disruption paths: a bi-objective approach (English)
0 references
18 October 2016
0 references
network interdiction
0 references
multi-objective programming
0 references
mixed integer linear programming
0 references
critical disruption path
0 references
connected components
0 references
