Coverage of Network-Based Structures: Paths, Tours and Trees
暂无分享,去创建一个
[1] Vicki Aaronson Hutson,et al. Maximal Direct Covering Tree Problems , 1989, Transp. Sci..
[2] Peter J. Slater. Some definitions of central structures , 1984 .
[3] Richard L. Church,et al. The Shortest Covering Path Problem , 2016 .
[4] Kevin M. Curtin,et al. The Transit Route Arc-Node Service Maximization problem , 2011, Eur. J. Oper. Res..
[5] P. Slater. Locating Central Paths in a Graph , 1982 .
[6] Paolo Toth,et al. The Generalized Covering Salesman Problem , 2012, INFORMS J. Comput..
[7] J. Current,et al. The maximum covering/shortest path problem: A multiobjective network design and routing formulation , 1985 .
[8] J. Current,et al. The median tour and maximal covering tour problems: Formulations and heuristics , 1994 .
[9] Timothy John Niblett. On the Development of a New Class of Covering Path Models , 2016 .
[10] Peter J. Slater,et al. A Linear Algorithm for a Core of a Tree , 1980, J. Algorithms.
[11] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[12] Erik Rolland,et al. Efficient Algorithms for Solving the Shortest Covering Path Problem , 1994, Transp. Sci..
[13] J. Current,et al. Maximal covering tree problems , 1993 .
[14] Alan T. Murray,et al. Strategic route extension in transit networks , 2006, Eur. J. Oper. Res..
[15] Mark S. Daskin,et al. Network and Discrete Location: Models, Algorithms and Applications , 1995 .
[16] Vicki Aaronson Hutson,et al. Indirect covering tree problems on spanning tree networks , 1993 .
[17] Peter J. Slater. On Locating a Facility to Service Areas within a Network , 1981, Oper. Res..
[18] John R Current,et al. Multiobjective design of transportation networks , 1981 .
[19] J. Oppong. Accommodating the rainy season in Third World location-allocation applications , 1996 .
[20] M. Fischetti,et al. AN ADDITIVE APPROACH FOR THE OPTIMAL SOLUTION OF THE PRIZE-COLLECTING TRAVELLING SALESMAN PROBLEM. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1988 .
[21] Michel Gendreau,et al. The Covering Tour Problem , 1997, Oper. Res..
[22] John R. Current,et al. The Covering Salesman Problem , 1989, Transp. Sci..
[23] G. Laporte,et al. NEW DIRECTIONS IN PLANT LOCATION , 1993 .
[24] Gilbert Laporte,et al. The selective travelling salesman problem , 1990, Discret. Appl. Math..
[25] Richard L. Church,et al. Improving accessibility to rural health services: The maximal covering network improvement problem , 2009 .
[26] Fernando Antonio Medrano,et al. A Parallel Computing Framework for Finding the Supported Solutions to a Biobjective Network Optimization Problem , 2015 .
[27] Charles ReVelle,et al. SYMPOSIUM ON LOCATION PROBLEMS: IN MEMORY OF LEON COOPER.: THE SHORTEST COVERING PATH PROBLEM: AN APPLICATION OF LOCATIONAL CONSTRAINTS TO NETWORK DESIGN , 1984 .
[28] Brian Boffey,et al. Models for multi-path covering-routing problems , 1998, Ann. Oper. Res..
[29] Jared L. Cohon,et al. Multiobjective programming and planning , 2004 .
[30] S. Hakimi. Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems , 1965 .
[31] Esther M. Arkin,et al. Approximating the Tree and Tour Covers of a Graph , 1993, Inf. Process. Lett..
[32] Alan T. Murray,et al. Optimizing Public Transit Quality and System Access: The Multiple-Route, Maximal Covering/Shortest-Path Problem , 2005 .
[33] Esther M. Arkin,et al. Approximation Algorithms for the Geometric Covering Salesman Problem , 1994, Discret. Appl. Math..
[34] R. A. Zemlin,et al. Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.
[35] William J. Cook,et al. Solution of a Large-Scale Traveling-Salesman Problem , 1954, 50 Years of Integer Programming.
[36] R. Church,et al. Corridor Location for Infrastructure Development , 2014 .
[37] Pitu B. Mirchandani,et al. Location on networks : theory and algorithms , 1979 .
[38] Alan T. Murray,et al. Accessibility tradeoffs in public transit planning , 2003, J. Geogr. Syst..