The optimal tenement allocation for reducing traffic burden

DOI10.1007/s40305-015-0100-4zbMath1342.90092OpenAlexW2216189441MaRDI QIDQ2630839

Kelin Luo, Yong-Feng Cao, Yin-Feng Xu

Publication date: 22 July 2016

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-015-0100-4

zbMATH Keywords

modified Hungarian algorithmtenement allocationtraffic burdentransport fee

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Arrangements of curves in the plane --- topology, combinatorics, and algorithms
• On Bipartite Drawings and the Linear Arrangement Problem
• Perfect Matchings in $O(n\log n)$ Time in Regular Bipartite Graphs
• Algorithms for the Assignment and Transportation Problems
• A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
• The school bus routing problem: a case study
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: The optimal tenement allocation for reducing traffic burden