An extended network interdiction problem for optimal toll control

DOI10.1016/j.endm.2016.03.040zbMath1351.90113OpenAlexW2394952968MaRDI QIDQ325471

Stephan Schwartz, Guillaume Sagnol, Ralf Borndörfer

Publication date: 18 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.03.040

zbMATH Keywords

Benders decompositionnetwork interdictionlength-bounded cuts

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Related Items (2)

Vertex covering with capacitated trees ⋮ Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire

Cites Work

• Unnamed Item
• Unnamed Item
• Most vital links and nodes in weighted networks
• Mengerian theorems for paths of bounded length
• Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation
• A Stackelberg Game to Optimize the Distribution of Controls in Transportation Networks
• Length-Bounded Cuts and Flows
• A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network
• Multiway cuts in directed and node weighted graphs
• Shortest-path network interdiction
• Bilevel programming and price setting problems

This page was built for publication: An extended network interdiction problem for optimal toll control