Network interdiction through length-bounded critical disruption paths: a bi-objective approach (Q325490): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 17:42, 12 July 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
