Theory and Practice in Large Carpooling Problems
暂无分享,去创建一个
Davy Janssens | Luk Knapen | Daniel Keren | Ansar-Ul-Haque Yasar | Elad Cohen | Irith Ben-Arroyo Hartman | Abed Abu Dbai
[1] Davy Janssens,et al. Estimating Scalability Issues While Finding an Optimal Assignment for Carpooling , 2013, ANT/SEIT.
[2] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[3] H. W. Kuhn B R Y N Mawr College. Variants of the Hungarian Method for Assignment Problems' , 1955 .
[4] Yunmei Chen,et al. Projection Onto A Simplex , 2011, 1101.6081.
[5] Davy Janssens,et al. Exploiting graph-theoretic tools for matching in carpooling applications , 2013, Journal of Ambient Intelligence and Humanized Computing.
[6] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[7] Geraldo Galdino de Paula,et al. A linear-time median-finding algorithm for projecting a vector on the simplex of Rn , 1989 .
[8] J. Munkres. ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .
[9] Silvio Micali,et al. Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[10] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[11] Alessandro Persona,et al. THE CAR POOLING PROBLEM: HEURISTIC ALGORITHMS BASED ON SAVINGS FUNCTIONS , 2003 .
[12] Silvio Micali,et al. An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).