The quickest transshipment problem
From MaRDI portal
Recommendations
Cited in
(82)- Efficient contraflow algorithms for quickest evacuation planning
- The mixed evacuation problem
- Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks
- On solving quickest time problems in time-dependent, dynamic networks
- A capacitated network flow optimization approach for short notice evacuation planning
- Optimal egress time calculation and path generation for large evacuation networks
- A heuristic algorithm for the earliest arrival flow with multiple sources
- Heterogeneous multi-commodity network flows over time
- \textsc{Conjure}: automatic generation of constraint models from problem specifications
- Emergency evacuation problem for a multi-source and multi-destination transportation network: mathematical model and case study
- Network flow with intermediate storage: models and algorithms
- Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
- Abstract flows over time: a first step towards solving dynamic packing problems
- A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem
- A simplex-type algorithm for continuous linear programs with constant coefficients
- Minmax regret k-sink location on a dynamic path network with uniform capacities
- Minimizing ratio of monotone non-submodular functions
- Discrete Newton methods for the evacuation problem
- Evacuation planning by earliest arrival contraflow
- Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\)
- Multicommodity flows over time: Efficient algorithms and complexity
- Continuous dynamic contraflow approach for evacuation planning
- A survey on models and algorithms for discrete evacuation planning network problems
- A Stackelberg strategy for routing flow over time
- A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
- Faster algorithms for the quickest transshipment problem
- Universally maximum flow with piecewise-constant capacities
- The dynamic transshipment problem
- Earliest arrival flows in networks with multiple sinks
- The mixed evacuation problem
- An introduction to network flows over time
- Algorithms for finding optimal flows in dynamic networks
- Universal packet routing with arbitrary bandwidths and transit times
- Quickest cluster flow problems on tree networks
- Reliable and restricted quickest path problems
- The Maximum Energy-Constrained Dynamic Flow Problem
- A simplex algorithm for minimum-cost network-flow problems in infinite networks
- Traffic Networks and Flows over Time
- A polynomial-time algorithm for the universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths
- scientific article; zbMATH DE number 3932761 (Why is no real title available?)
- scientific article; zbMATH DE number 1303551 (Why is no real title available?)
- Fast and memory-efficient algorithms for evacuation problems
- Algorithms for the quickest time distribution of dynamic stochastic-flow networks
- scientific article; zbMATH DE number 910909 (Why is no real title available?)
- Earliest arrival flows in networks with multiple sinks
- Dynamic Atomic Congestion Games with Seasonal Flows
- Maximum contraflow evacuation planning problems on multi-network
- A critical survey on the network optimization algorithms for evacuation planning problems
- Synchronized traveling salesman problem
- Non-approximability and polylogarithmic approximations of the single-sink unsplittable and confluent dynamic flow problems
- Optimal evacuation solutions for large-scale scenarios
- MIN-MAX quickest path problems
- An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity
- Bounding Residence Times for Atomic Dynamic Routings
- Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks
- FlowLoc problems with maximum excess flow
- Lexicographically optimal earliest arrival flows
- A note on the quickest minimum cost transshipment problem
- Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows
- Capacity provisioning for evacuation on path networks
- An introduction to dynamic generative networks: minimum cost flow
- Generalized maximum flow over time with intermediate storage
- Sink location problems in dynamic flow grid networks
- Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges
- Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
- Sink location problems in dynamic flow grid networks
- Solution of a transshipment problem with uncertain parameters under impaired and enhanced flow
- Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges
- Minimum-peak-cost flows over time
- The minimum-cost dynamic flow problem in a fixed graph with a constant target flow value
- Network restructuring for dynamic flow improvement
- Improved algorithms for optimal k sink location on path networks
- Maximum dynamic FlowLoc with intermediate storage: a temporally repeated approach
- On the quickest evacuation location problem in humanitarian operations: multi-objective modelling and matheuristic solution
- Optimizing evacuation via budget constrained maximum dynamic flow with speed variation and intermediate storage
- A faster parametric search for the integral quickest transshipment problem
- The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths
- Flows in dynamic networks with aggregate arc capacities
- An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
- Truck dock assignment problem with operational time constraint within crossdocks
- An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths
- Submodular function minimization
This page was built for publication: The quickest transshipment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757622)
