Network interdiction through length-bounded critical disruption paths: a bi-objective approach (Q325490): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.endm.2016.03.049 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / 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 / namelinks / 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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references