The mixed evacuation problem

DOI10.1007/978-3-319-48749-6_2MaRDI QIDQ2958300zbMATH OpenOpenAlexFDO

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

Publication date 1 February 2017

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• The mixed evacuation problem
• The quickest transshipment problem
• An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths
• scientific article; zbMATH DE number 910909
• An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Finding disjoint paths with different path-costs: Complexity and algorithms
• Geometric algorithms and combinatorial optimization.
• Polynomial algorithms in linear programming
• Submodular functions and optimization.
• The quickest transshipment problem

Cited in

(4)

• Discrete Newton methods for the evacuation problem
• Efficient algorithms for ridesharing of personal vehicles
• An affine generalization of evacuation
• The mixed evacuation problem

This page was built for publication: The mixed evacuation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958300)