Pessimistic evasive flow capturing problems
DOI10.1016/j.ejor.2020.12.001zbMath1487.90078OpenAlexW3111841038MaRDI QIDQ2030509
Changhyun Kwon, Aigerim Bogyrbayeva
Publication date: 7 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.12.001
transportationbilevel optimizationpessimistic formulationmixed-integer programcutting plane algorithm
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Uses Software
Cites Work
- Generalized route planning model for hazardous material transportation with VaR and equity considerations
- Value-at-Risk model for hazardous material transportation
- Evasive flow capture: a multi-period stochastic facility location problem with independent demand
- Benders decomposition for the Hazmat transport network design problem
- On a class of bilevel linear mixed-integer programs in adversarial settings
- An effective bilevel programming approach for the evasive flow capturing location problem
- Population-based risk equilibration for the multimode hazmat transport network design problem
- A cutting plane approach for bilevel hazardous material transport network design
- Risk-Averse Shortest Path Interdiction
- The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
- Optimal Location of Discretionary Service Facilities
- Evasive flow capture: Optimal location of weigh‐in‐motion systems, tollbooths, and security checkpoints
- Locating Discretionary Service Facilities, II: Maximizing Market Size, Minimizing Inconvenience
- Generalized Bounded Rationality and Robust Multicommodity Network Design
- Exact Solution of the Evasive Flow Capturing Problem
- Pessimistic Bilevel Optimization
This page was built for publication: Pessimistic evasive flow capturing problems
