The Post-Disaster Debris Clearance Problem Under Incomplete Information
DOI10.1287/opre.2014.1342zbMath1327.90349OpenAlexW2134004529MaRDI QIDQ3195231
Özlem Ergun, Melih Çelik, Pinar Keskinocak
Publication date: 22 October 2015
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/11511/57754
partially observable Markov decision processescontinuous-time approximationsdebris clearanceonline and stochastic networks
Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25) Markov and semi-Markov decision processes (90C40)
Related Items (20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Incremental network design with shortest paths
- Emergency path restoration problems
- A simple and deterministic competitive algorithm for online facility location
- Incremental network design with maximum flows
- The online prize-collecting traveling salesman problem
- Strategic network restoration
- Optimal scheduling of emergency roadway repair and subsequent relief distribution
- The weighted majority algorithm
- Online stochastic optimization under time constraints
- Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
- Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems
- OR/MS research in disaster operations management
- Efficient algorithms for online decision problems
- Information Collection on a Graph
- Online traveling salesman problems with service flexibility
- Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
- Modeling Distribution Problems with Time Windows: Part I
- Modeling Distribution Problems with Time Windows. Part II: Two Customer Types
- Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules
- Competitive analysis for dynamic multiperiod uncapacitated routing problems
- Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
- On-line single-server dial-a-ride problems
This page was built for publication: The Post-Disaster Debris Clearance Problem Under Incomplete Information