scientific article; zbMATH DE number 7453713
From MaRDI portal
Publication:5020876
zbMath1480.90080MaRDI QIDQ5020876
Stephan Dempe, Tanka Nath Dhamala, Urmila Pyakurel
Publication date: 7 January 2022
Full work available at URL: http://www.orstw.org.tw/ijor/vol15no3/IJOR2018_vol15_no3_p101_p133.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Management decision making, including multiple objectives (90B50) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Dynamic multicommodity contraflow problem with asymmetric transit times, Dynamic network flow location models and algorithms for quickest evacuation planning, A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow, FlowLoc problems with maximum excess flow, Multi-commodity flow problem on lossy network with partial lane reversals, Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach, Unnamed Item, Network flow with intermediate storage: models and algorithms, Abstract network flow with intermediate storage for evacuation planning
Cites Work
- Flows over Time with Load-Dependent Transit Times
- On the Quickest Flow Problem in Dynamic Networks – A Parametric Min-Cost Flow Approach
- Constructing Maximal Dynamic Flows from Static Flows
- Quickest Flows Over Time
- Max flows in O(nm) time, or better
- An Algorithm for Universal Maximal Dynamic Flows in a Network
- Continuous-Time Flows in Networks
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Time-varying minimum cost flow problems
- Fast and simple approximation schemes for generalized flow.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An optimization approach for real time evacuation reroute planning
- A medical resource allocation model for serving emergency victims with deteriorating health conditions
- Multicriteria optimization in humanitarian aid
- Branch and bound algorithms for the bus evacuation problem
- Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
- Mathematical models for evacuation planning in urban areas.
- A robust bus evacuation model with delayed scenario information
- Connecting a population dynamic model with a multi-period location-allocation problem for post-disaster relief operations
- Reserving relief supplies for earthquake: a multi-attribute decision making of China Red Cross
- On the minimization of traffic congestion in road networks with tolls
- Continuous and discrete flows over time
- Planning for a bus-based evacuation
- Incremental network design with maximum flows
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Approximating earliest arrival flows with flow-dependent transit times
- An FPTAS for quickest multicommodity flows with inflow-dependent transit times
- The quickest path problem
- A survey of dynamic network flows
- Complexity analysis for maximum flow problems with arc reversals
- Evacuation planning using multiobjective evolutionary optimization approach
- Transient flows in networks
- Algorithms for the quickest path problem and the enumeration of quickest paths
- Continuous-time shortest path problems with stopping and starting costs
- Geometric algorithms and combinatorial optimization
- On the quickest path problem
- Efficient continuous-time dynamic network flow algorithms
- Efficient contraflow algorithms for quickest evacuation planning
- The mixed evacuation problem
- Continuous time dynamic contraflow models and algorithms
- Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity
- \(M / G / c / c\) state dependent travel time models and properties
- Evacuation network optimization model with Lane-based reversal and routing
- A finite-time algorithm for shortest path problems with time-varying costs
- On solving quickest time problems in time-dependent, dynamic networks
- Covering models and optimization techniques for emergency response facility location and planning: a review
- Abstract flows over time: a first step towards solving dynamic packing problems
- Relief distribution networks: a systematic review
- Evacuation planning by earliest arrival contraflow
- Time dependency in multiple objective dynamic programming
- Dioïds and semirings: Links to fuzzy sets and other applications
- Multicommodity flows over time: Efficient algorithms and complexity
- A comprehensive survey on the quickest path problem
- Continuous dynamic contraflow approach for evacuation planning
- Efficient continuous contraflow algorithms for evacuation planning problems
- Preface: Multiple criteria optimization and goal programming in science, engineering, and social sciences
- OR/MS research in disaster operations management
- Generalized max flow in series-parallel graphs
- Algorithms for time-dependent bicriteria shortest path problems
- An overview of bilevel optimization
- A survey on models and algorithms for discrete evacuation planning network problems
- A logistics model for the transport of disaster victims with various injuries and survival probabilities
- Dynamics of disasters -- key concepts, models, algorithms, and insights. Selected papers based on the presentations at the 2nd international conference, Kalamata, Greece, June 29 -- July 2015, 2015
- Optimum flows in general communication networks
- Faster Algorithms for the Quickest Transshipment Problem
- The Quickest Transshipment Problem
- Earliest Arrival Flows in Networks with Multiple Sinks
- Generalized Maximum Flows over Time
- Approximating Earliest Arrival Flows in Arbitrary Networks
- A Strongly Polynomial Algorithm for Generalized Flow Maximization
- Bi‐level programming based contra flow optimization for evacuation events
- Earliest arrival flows on series-parallel graphs
- Earliest Arrival Flows with Multiple Sources
- Maximal Flow Through a Network
- Optimal dynamic routing in communication networks with continuous traffic
- Finding Minimum-Cost Circulations by Successive Approximation
- Combinatorial Algorithms for the Generalized Circulation Problem
- A Polynomial Algorithm for Weighted Abstract Flow
- The building evacuation problem with shared information
- Some Properties of a Class of Continuous Linear Programs
- Minimum Convex Cost Dynamic Network Flows
- Optimal Time-Varying Flows on Congested Networks
- On the use of lexicographic min cost flows in evacuation modeling
- A continuous-time network simplex algorithm
- Extreme Points for Continuous Network Programs with Arc Delays
- Combinatorial Optimization with Rational Objective Functions
- Note—Some Equivalent Objectives for Dynamic Network Flow Problems
- A Class of Continuous Network Flow Problems
- Finding disjoint paths with different path-costs: Complexity and algorithms
- The quickest flow problem
- Optimal flows in networks with multiple sources and sinks
- Maximal, Lexicographic, and Dynamic Network Flows
- A generalization of max flow—min cut
- A generalized dynamic flows problem
- An Algorithm for a Class of Continuous Linear Programs
- A new approach to the minimum cut problem
- A Study of General Dynamic Network Programs with Arc Time-Delays
- Minimum-cost dynamic flows: The series-parallel case
- Cancel-and-tighten algorithm for quickest flow problems
- A Fast Parametric Maximum Flow Algorithm and Applications
- An adaptive discretization algorithm for a class of continuous network programs
- Minimum cost dynamic flows: The series-parallel case
