Emergency path restoration problems

DOI10.1016/j.disopt.2012.01.001zbMath1242.90073MaRDI QIDQ435733

Igor Averbakh

Publication date: 12 July 2012

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2012.01.001

zbMATH Keywords

scheduling; combinatorial optimization; polynomial algorithm; network construction

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90B35: Deterministic scheduling theory in operations research

90C27: Combinatorial optimization

Related Items

Exact and Approximation Algorithms for the Expanding Search Problem, Lateness Minimization in Pairwise Connectivity Restoration Problems, Integrated reinforcement and repair of interdependent infrastructure networks under disaster-related uncertainties, Incremental network design with shortest paths, Interdependent network restoration: on the value of information-sharing, Network construction problems with due dates, Solution methodologies for debris removal in disaster response, Online scheduling problems with flexible release dates: applications to infrastructure restoration, Dynamic resource allocation to support oil spill response planning for energy exploration in the Arctic, Interdependent integrated network design and scheduling problems with movement of machines, Incremental Network Design with Minimum Spanning Trees, The Post-Disaster Debris Clearance Problem Under Incomplete Information, Quantitative Models for Infrastructure Restoration After Extreme Events: Network Optimization Meets Scheduling

Uses Software

• DARCLASS

Cites Work

• Unnamed Item
• Profit-based latency problems on the line
• A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times
• Vehicle routing problems on a line-shaped network with release time constraints
• Computer-Aided Complexity Classification of Dial-a-Ride Problems
• Routing and Scheduling on a Shoreline with Release Times
• The complexity of the travelling repairman problem
• Special cases of traveling salesman and repairman problems with time windows
• Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path