Robust optimization for the hazardous materials transportation network design problem
DOI10.1007/s10878-014-9751-zzbMath1327.90357OpenAlexW1985853985MaRDI QIDQ2355987
Binhai Zhu, Letu Qingge, Chunlin Xin, Jiamin Wang
Publication date: 28 July 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9751-z
computational complexityheuristic algorithmsrobust optimizationhazmat transportation network designuncertain edge risk
Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- The computational complexity of the relative robust shortest path problem with interval data
- Designing a road network for hazardous materials shipments
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- A branch and bound algorithm for the robust shortest path problem with interval data.
- Interval data minmax regret network optimization problems
- An exact algorithm for the robust shortest path problem with interval data
- Solving the hazmat transport network design problem
- An overview of bilevel optimization
- The robust shortest path problem with interval data via Benders decomposition
- Modeling of Transport Risk for Hazardous Materials
- On the Hazmat Transport Network Design Problem
- Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems
- The Price of Robustness
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The robust spanning tree problem with interval data
This page was built for publication: Robust optimization for the hazardous materials transportation network design problem