Bi-objective optimization models for network interdiction

DOI10.1051/ro/2017050zbMath1430.90540OpenAlexW2625501855MaRDI QIDQ5242348

Shenghan Yu, Cheng Guo, Yan Chen

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

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

Cites Work

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

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