An Introduction to Network Flows over Time

DOI10.1007/978-3-540-76796-1_21zbMath1359.90020OpenAlexW2234958105MaRDI QIDQ2971621

Publication date: 7 April 2017

Published in: Research Trends in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15637

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (69)

Earliest Arrival Flows in Networks with Multiple Sinks ⋮ Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle ⋮ Algorithms for Flows over Time with Scheduling Costs ⋮ On the motion of substance in a channel of a network and human migration ⋮ Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period ⋮ Minimum parametric flow in time-dependent dynamic networks ⋮ Discrete-time model for a motion of substance in a channel of a network with application to channels of human migration ⋮ A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem ⋮ Dynamic Equilibria in Fluid Queueing Networks ⋮ Statistical distributions connected to motion of substance in a channel of a network ⋮ Computation of Dynamic Equilibria in Series-Parallel Networks ⋮ Synchronized Traveling Salesman Problem ⋮ On the Price of Anarchy for Flows over Time ⋮ A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs ⋮ Dynamic network flow location models and algorithms for quickest evacuation planning ⋮ A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow ⋮ On the complexity of instationary gas flows ⋮ Dynamic flows with time-dependent capacities ⋮ Lexicographically optimal earliest arrival flows ⋮ Equilibria in routing games with edge priorities ⋮ Scheduling arc maintenance jobs in a network to maximize total flow over time ⋮ A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation ⋮ A note on the quickest minimum cost transshipment problem ⋮ Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows ⋮ Scalable timing-aware network design via Lagrangian decomposition ⋮ Temporal flows in temporal networks ⋮ Approximation algorithms for the generalized incremental knapsack problem ⋮ Pattern-based evacuation planning for urban areas ⋮ Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach ⋮ Continuous and discrete flows over time ⋮ Dynamic graph generation for the shortest path problem in time expanded networks ⋮ Facets of the Stochastic Network Flow Problem ⋮ Ship Traffic Optimization for the Kiel Canal ⋮ On solving continuous-time dynamic network flows ⋮ Nash equilibria and the price of anarchy for flows over time ⋮ A polynomial time algorithm for the minimum flow problem in time-varying networks ⋮ Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights ⋮ Optimal regulation of flow networks with transient constraints ⋮ Computational complexity of convoy movement planning problems ⋮ Earliest arrival flows in networks with multiple sinks ⋮ The complexity of routing with collision avoidance ⋮ An exact algorithm for a multicommodity min-cost flow over time problem ⋮ Arc flow formulations based on dynamic programming: theoretical foundations and applications ⋮ Existence and Uniqueness of Equilibria for Flows over Time ⋮ Abstract flows over time: a first step towards solving dynamic packing problems ⋮ Static analysis of multi-core TDMA resource arbitration delays ⋮ Flows over time in time-varying networks: optimality conditions and strong duality ⋮ Perspectives on integer programming for time-dependent models ⋮ Minimum flow problem on network flows with time-varying bounds ⋮ A heuristic algorithm for the earliest arrival flow with multiple sources ⋮ Competitive routing over time ⋮ Robust flows over time: models and complexity results ⋮ A tight bound on the speed-up through storage for quickest multi-commodity flows ⋮ Improved algorithms for the evacuation route planning problem ⋮ A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem ⋮ A Stackelberg strategy for routing flow over time ⋮ Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks ⋮ Subset Selection in Sparse Matrices ⋮ On the approximability of time disjoint walks ⋮ Dynamic flows with adaptive route choice ⋮ Dynamic Atomic Congestion Games with Seasonal Flows ⋮ Traffic Networks and Flows over Time ⋮ On the motion of substance in a channel and growth of random networks ⋮ Discrete Newton methods for the evacuation problem ⋮ Heterogeneous multi-commodity network flows over time ⋮ Branch-and-refine for solving time-expanded MILP formulations ⋮ Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems ⋮ Algorithms for flows over time with scheduling costs ⋮ Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks

Cites Work

This page was built for publication: An Introduction to Network Flows over Time