Postman Problems on Mixed Graphs
作者： Zaragoza Martinez , Francisco Javier
DOI:
关键词: Mixed graph 、 Combinatorial optimization 、 Discrete mathematics 、 Mathematics 、 Approximation algorithm
摘要:
参考文章(68)
Hong Yan, Gerald L. Thompson, Finding Postal Carrier Walk Paths in Mixed Graphs Computational Optimization and Applications. ,vol. 9, pp. 229- 247 ,(1998) , 10.1023/A:1018350224084
Kriangchai Yaoyuenyong, Peerayuth Charnsethikul, Vira Chankong, A Heuristic Algorithm for the Mixed Chinese Postman Problem Optimization and Engineering. ,vol. 3, pp. 157- 187 ,(2002) , 10.1023/A:1020915403051
Casimir Kuratowski, Sur le problème des courbes gauches en Topologie Fundamenta Mathematicae. ,vol. 15, pp. 271- 283 ,(1930) , 10.4064/FM-15-1-271-283
Balaji Raghavachari, Jeyakesavan Veerasamy, Approximation algorithms for postman problems The University of Texas at Dallas. ,(1999)
Horst A Eiselt, Michel Gendreau, Gilbert Laporte, ARC ROUTING PROBLEMS. ,(1994)
Karl Menger, Zur allgemeinen Kurventheorie Fundamenta Mathematicae. ,vol. 10, pp. 96- 115 ,(1927) , 10.4064/FM-10-1-96-115
Wiley‐Interscience Series in Discrete Mathematics and Optimization John Wiley & Sons, Inc.. pp. 335- 336 ,(2011) , 10.1002/9781118032718.SCARD
Dénes König, Theorie der endlichen und unendlichen Graphen : kombinatorische Topologie der Streckenkomplexe Chelsea. ,(1935)
Herbert Fleischner, Eulerian graphs and related topics ,(1990)
Peter Brucker, The Chinese Postman Problem for Mixed Graphs workshop on graph theoretic concepts in computer science. pp. 354- 366 ,(1980) , 10.1007/3-540-10291-4_26