Robust Optimization for the Hazardous Materials Transportation Network Design Problem

DOI10.1007/978-3-319-03780-6_33zbMath1407.90084MaRDI 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

zbMATH Keywords

computational complexity; robust optimization; heuristic method; hazmat network design

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C59: Approximation methods and heuristics in mathematical programming

90B10: Deterministic network models in operations research

90C27: Combinatorial optimization

Related Items

Managing reliable emergency logistics for hazardous materials: a two-stage robust optimization approach

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