The Mixed Evacuation Problem
From MaRDI portal
Publication:2958300
DOI10.1007/978-3-319-48749-6_2zbMath1436.90027MaRDI QIDQ2958300
Yuya Higashikawa, Atsushi Takizawa, Naoyuki Kamiyama, Yosuke Hanawa, Naoki Katoh
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
90C35: Programming involving graphs or networks
90B06: Transportation, logistics and supply chain management
90B10: Deterministic network models in operations research
05C20: Directed graphs (digraphs), tournaments
Related Items
Cites Work
- 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)
- Submodular functions and optimization.
- The Quickest Transshipment Problem
- 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
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm