The following pages link to A survey of dynamic network flows (Q917417):
Displaying 50 items.
- Pricing and balancing of the sea-cargo service chain with empty equipment repositioning (Q337385) (← links)
- A model-based approach and analysis for multi-period networks (Q353173) (← links)
- Single source single-commodity stochastic network design (Q373182) (← links)
- Pattern-based evacuation planning for urban areas (Q421705) (← links)
- On solving continuous-time dynamic network flows (Q453631) (← links)
- Computational complexity of convoy movement planning problems (Q494695) (← links)
- Continuous and discrete flows over time (Q634790) (← links)
- Nash equilibria and the price of anarchy for flows over time (Q647485) (← links)
- An introduction to dynamic generative networks: minimum cost flow (Q651703) (← links)
- Minimum flow problem on network flows with time-varying bounds (Q693577) (← links)
- A minmax regret version of the time-dependent shortest path problem (Q724002) (← links)
- Optimal flow control in acyclic networks with uncontrollable routings and precedence constraints (Q763409) (← links)
- Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle (Q828730) (← links)
- Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system (Q829193) (← links)
- Flows in dynamic networks with aggregate arc capacities (Q845886) (← links)
- Resource downgrading (Q856251) (← links)
- An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks (Q860399) (← links)
- Allocation of empty containers between multi-ports (Q879313) (← links)
- Truck dock assignment problem with operational time constraint within crossdocks (Q948655) (← links)
- Maximum flow problem on dynamic generative network flows with time-varying bounds (Q988972) (← links)
- One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs (Q1273088) (← links)
- Iterative improvement methods for a multiperiod network design problem (Q1303714) (← links)
- Efficient continuous-time dynamic network flow algorithms (Q1306377) (← links)
- Solving a class of network models for dynamic flow control (Q1333519) (← links)
- A tabu search heuristic procedure for the fixed charge transportation problem (Q1609908) (← links)
- A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem (Q1651593) (← links)
- A polynomial time algorithm for the minimum flow problem in time-varying networks (Q1730612) (← links)
- Time-dependent optimization of a multi-item uncertain supply chain network: a hybrid approximation algorithm (Q1751136) (← links)
- Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks (Q1751923) (← links)
- Robust flows over time: models and complexity results (Q1785195) (← links)
- A new hierarchical architecture for air traffic management: optimisation of airway capacity in a free flight scenario (Q1869699) (← links)
- Graceful reassignment of excessively long communications paths in networks (Q1887906) (← links)
- Optimal egress time calculation and path generation for large evacuation networks (Q1945097) (← links)
- Determining the optimal flows in zero-time dynamic networks (Q1951168) (← links)
- A heuristic algorithm for the earliest arrival flow with multiple sources (Q2016467) (← links)
- On the motion of substance in a channel and growth of random networks (Q2078640) (← links)
- Heterogeneous multi-commodity network flows over time (Q2097229) (← links)
- Abstract network flow with intermediate storage for evacuation planning (Q2103018) (← links)
- Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters (Q2106726) (← links)
- Minmax regret for sink location on dynamic flow paths with general capacities (Q2133396) (← links)
- On the motion of substance in a channel of a network and human migration (Q2150067) (← links)
- Discrete-time model for a motion of substance in a channel of a network with application to channels of human migration (Q2153209) (← links)
- Statistical distributions connected to motion of substance in a channel of a network (Q2161723) (← links)
- A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem (Q2286869) (← links)
- Partial contraflow with path reversals for evacuation planning (Q2288951) (← links)
- A decomposition-based approach for the multiperiod multiproduct distribution planning problem (Q2336751) (← links)
- Optimization and sustainable development (Q2355714) (← links)
- Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\) (Q2362245) (← links)
- Multicommodity flows over time: Efficient algorithms and complexity (Q2373727) (← links)
- Continuous dynamic contraflow approach for evacuation planning (Q2399339) (← links)
