Robust Optimization for the Hazardous Materials Transportation Network Design Problem
From MaRDI portal
Publication:2867136
DOI10.1007/978-3-319-03780-6_33zbMath1407.90084OpenAlexW2399936878MaRDI QIDQ2867136
Qingge Letu, Chunlin Xin, Yin Bai
Publication date: 10 December 2013
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-03780-6_33
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (1)
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
- Radiation Hybrid Map Construction Problem Parameterized
- 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
This page was built for publication: Robust Optimization for the Hazardous Materials Transportation Network Design Problem
