An effective bilevel programming approach for the evasive flow capturing location problem
From MaRDI portal
Publication:2005787
DOI10.1007/s11067-018-9415-0OpenAlexW2887007495MaRDI QIDQ2005787
S. A. MirHassani, F. Hooshmand
Publication date: 8 October 2020
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11067-018-9415-0
bi-level programevasive flow capturing problemexact decomposition-based algorithmKKT-based reformulationvehicle inspection stationsweigh-in-motion
Related Items (2)
Pessimistic evasive flow capturing problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A branch and bound algorithm for bi-level discrete network design problem
- A Dantzig-Wolfe decomposition based heuristic scheme for bi-level dynamic network design problem
- A link-node discrete-time dynamic second best toll pricing model with a relaxation solution algorithm
- Flow intercepting facility location: Problems, models and heuristics
- Bi-level programming model and hybrid genetic algorithm for flow interception problem with customer choice
- Foundations of bilevel programming
- Multilevel decision-making: a survey
- Evasive flow capture: a multi-period stochastic facility location problem with independent demand
- An extended Kuhn-Tucker approach for linear bilevel programming
- Resolution method for mixed integer bi-level linear problems based on decomposition technique
- An overview of bilevel optimization
- Lagrangean relaxation-based algorithm for bi-level problems
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- The polynomial hierarchy and a simple model for competitive analysis
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Evasive flow capture: Optimal location of weigh‐in‐motion systems, tollbooths, and security checkpoints
- Shortest-path network interdiction
This page was built for publication: An effective bilevel programming approach for the evasive flow capturing location problem