The mixed evacuation problem

DOI10.1007/s10878-017-0237-7zbMath1414.90305OpenAlexW2797368619MaRDI QIDQ1631682

Yuya Higashikawa, Naoyuki Kamiyama, Atsushi Takizawa, Naoki Katoh, Yosuke Hanawa

Publication date: 6 December 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2324/4363021

zbMATH Keywords

submodular functionevacuation problemdynamic network flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric algorithms and combinatorial optimization.
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• The Quickest Transshipment Problem
• Earliest Arrival Flows with Multiple Sources
• A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
• Polynomial algorithms in linear programming
• Finding disjoint paths with different path-costs: Complexity and algorithms
• Cancel-and-tighten algorithm for quickest flow problems
• Fast and Memory-Efficient Algorithms for Evacuation Problems
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• On the Quickest Flow Problem in Dynamic Networks – A Parametric Min-Cost Flow Approach
• Constructing Maximal Dynamic Flows from Static Flows

This page was built for publication: The mixed evacuation problem