Lexicographically optimal earliest arrival flows

DOI10.1002/net.21902WikidataQ127617286 ScholiaQ127617286MaRDI QIDQ6068531

Naoyuki Kamiyama

Publication date: 13 November 2023

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

submodular functiondynamic networkearliest arrival flowevacuation problemlexicographically optimal flowtime-expanded network

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Earliest arrival flows in networks with multiple sinks
• A faster strongly polynomial time algorithm for submodular function minimization
• Transient flows in networks
• Equivalence of convex minimization problems over base polytopes
• Submodular functions and optimization.
• Faster Algorithms for the Quickest Transshipment Problem
• The Quickest Transshipment Problem
• Approximating Earliest Arrival Flows in Arbitrary Networks
• An Introduction to Network Flows over Time
• Earliest Arrival Flows with Multiple Sources
• Optimal dynamic routing in communication networks with continuous traffic
• A new approach to the maximum-flow problem
• Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
• On the structure of all minimum cuts in a network and applications
• Optimal flows in networks with multiple sources and sinks
• Maximal, Lexicographic, and Dynamic Network Flows
• Fast and Memory-Efficient Algorithms for Evacuation Problems
• The Simplex Algorithm Is NP-Mighty
• A Fast Parametric Maximum Flow Algorithm and Applications
• Optimal Evacuation Solutions for Large-Scale Scenarios
• Quickest Flows Over Time

This page was built for publication: Lexicographically optimal earliest arrival flows