The DT-polynomial approach to discrete time-varying network flow problems

DOI10.1016/0016-0032(78)90107-2zbMath0373.90024OpenAlexW1965353069MaRDI QIDQ1245139

K. Appert

Publication date: 1978

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(78)90107-2

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• On the computational power of pushdown automata
• Topological sorting of large networks
• Maximal, Lexicographic, and Dynamic Network Flows
• Dynamic network flows with arc changes
• On building minimum cost communication networks over time
• Shortest path with time constraints on movement and parking
• An Appraisal of Some Shortest-Path Algorithms
• Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers
• Depth-First Search and Linear Graph Algorithms
• On Multi-Commodity Maximal Dynamic Flows
• Minimum cost routing for dynamic network models

This page was built for publication: The DT-polynomial approach to discrete time-varying network flow problems