Exact Solution of the Evasive Flow Capturing Problem

DOI10.1287/opre.2018.1756zbMath1446.90049OpenAlexW2901274057MaRDI QIDQ5131542

Gilbert Laporte, Okan Arslan, Ola Jabali

Publication date: 8 November 2020

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.2018.1756

zbMATH Keywords

projectionlocationbranch-and-cutbilevel programmingroutingevasive flow capturing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (5)

Managing Product Transitions: A Bilevel Programming Approach ⋮ Benders Subproblem Decomposition for Bilevel Problems with Convex Follower ⋮ An exact bidirectional pulse algorithm for the constrained shortest path ⋮ Pessimistic evasive flow capturing problems ⋮ A Benders decomposition algorithm for the maximum availability service facility location problem

Uses Software

• PORTA
• JGraphT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch and price approach for routing and refueling station location model
• On an exact method for the constrained shortest path problem
• Locating flow-capturing units on a network with multi-counting and diminishing returns to scale
• Evasive flow capture: a multi-period stochastic facility location problem with independent demand
• Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach
• Heuristic algorithms for siting alternative-fuel stations using the flow-refueling location model
• A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
• A Stackelberg Game to Optimize the Distribution of Controls in Transportation Networks
• On the Hazmat Transport Network Design Problem
• Joint Design and Pricing on a Network
• Polyhedral Approaches to Mixed Integer Linear Programming
• Optimal Location of Discretionary Service Facilities
• A Complexity Measure
• A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network
• Evasive flow capture: Optimal location of weigh‐in‐motion systems, tollbooths, and security checkpoints
• The Inspection Station Location Problem In Hazardous Material Transportation: Some Heuristics And Bounds
• Near-shortest and K-shortest simple paths
• Fare Evasion in Transit Networks

This page was built for publication: Exact Solution of the Evasive Flow Capturing Problem