Bi-objective optimization models for network interdiction

DOI10.1051/RO/2017050MaRDI QIDQ5242348zbMATH OpenOpenAlexFDO

Authors Yan Chen, Cheng Guo, Shenghan Yu

Publication date 6 November 2019

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ro/2017050

zbMATH Keywords

network flowsbi-objective optimization interdiction

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 2050723
• A dynamic network interdiction problem
• Solving the bi-objective maximum-flow network-interdiction problem
• A survey of network interdiction models and algorithms
• Algorithms for network interdiction and fortification games

Cites work

• An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• An inventory-location model: Formulation, solution algorithm and computational results
• Deterministic network interdiction
• Network-based accessibility measures for vulnerability analysis of degradable transportation networks
• On the power of randomization in network interdiction
• Removing Arcs from a Network
• Using mixed-integer programming to solve power grid blackout problems

Cited in

(4)

• Multi-Period Max Flow Network Interdiction with Restructuring for Disrupting Domestic Sex Trafficking Networks
• A survey of network interdiction models and algorithms
• Network interdiction through length-bounded critical disruption paths: a bi-objective approach
• Deception tactics for network interdiction: a multiobjective approach

This page was built for publication: Bi-objective optimization models for network interdiction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5242348)