Download:
|
by London N Nq, Intr Oduction, Findingtheshortestroutefora Travellingsalesman, Providesandexplainsexecutablecodetosolve The
http://www.cs.mdx.ac.uk/harold/srf/cpp.ps
Add To MetaCart
Abstract:
The Chinese Postman Problem on w eighted directedm ultigraphshas man y applications, includinganalysinginteractive system and w eb siteusability. Clear algorithmsforthe problem are not available.This paper derives an algorithm, which ispresentedasa complete,executableJava class,and itshows thatno significantlymore e-- cient algorithmispossible.The paperalsosolvesa generalisation, the directedRural Chinese Postman.
Citations
|
6
|
Algorithms for the windy postman problem
– Pearn, Li
- 1994
|
|
3
|
Algorithms for the Rural Postman Problem
– Pearn, Liu
- 1995
|
|
3
|
Thimbleby,\VisualisingthePotentialofInteractive Systems
– W
- 1986
|
|
2
|
J.Wilson,Graphsand Applications,The Op en University,SpringerVerlag,2000
– Aldous
- 2000
|
|
2
|
Chen,\TestSequenceGenerationfromtheProtocolData PortionBasedon theSelectingChinese PostmanProblem
– W-H
|
|
2
|
S.Orloff,\A FundamentalProbleminVehicleRouting
– unknown authors
|
|
2
|
Papadimitriou,\On theComplexity ofEdge Traversing
– H
|
|
2
|
Lombardi,\Graph AlgorithmsforConformanceTestingusingtheRuralChinese PostmanTour
– Shen
|
|
1
|
Tarjan,\FasterAlgorithmsfortheShortestPath Problem
– Ahuja, Mehlhorn, et al.
|
|
1
|
Henzinger,ExploringUnknown Environments,DigitalSystemsResearch Center,SRC
– R
|
|
1
|
J.Gosling,The Java TM Programming LanguageSecond Edition,2nd.ed.,Addison-Wesley
– Arnold
- 1998
|
|
1
|
On Some ApplicationsoftheChinese PostmanProblem," inPaths,Flowsand VLSI-layout
– Barahona
|
|
1
|
Bodin,\Networksand Vehicle RoutingforMunicipalW asteCollection," Networks
– Beltrami
|
|
1
|
Brucker,\The ChinesePostmanProblemfor MixedNetworks
– unknown authors
|
|
1
|
J.Camer on,Combinatorics:Topics,Techniques, Algorithms,Cam bridgeUniversity Press,1994
– unknown authors
|
|
1
|
t#& A. Romero,\Heuristics fortheMixedRuralPostmanProblem," Computers
– an, Mar
|
|
1
|
Solutionofa Large-scaleTravelingSalesman Problem
– antzig, Fulkerson
|
|
1
|
Johnson,\Matching,Euler Toursand theChinesePostman
– L
|
|
1
|
Gendrea u
– Eiselt, M
|
|
1
|
Eisel t,M. Gendrea u
– A
|
|
1
|
Frederickson,\ApproximationAlgorithms forSome PostmanProblems
– N
- 1979
|
|
1
|
Improta,\An Algorithmforthe HierarchicalChinesePostmanProblem
– Ghian, G
|
|
1
|
Tarjan,\Finding Minimum-CostCirculationsby CancelingNegative Cycles
– Goldberg
|
|
1
|
Partyka,\On The Road to E--ciency
– Hall
|
|
1
|
PrimalMethod forMinimum Cost Flows withApplicationstoAssignmentand TransportationProblems," ManagementScience
– Klein, \A
|
|
1
|
Beck,ElementaryLinear Programming withApplications,AcademicPress,2nd
– olman
|
|
1
|
orsan,\Mixed-IntegerLinearProgramming
– K
|
|
1
|
Fogel,How toSolveIt: Mo dernHeuristics,Springer,2000. [42]NokiaMobilePhones,Nokia2110User'sGuide,Issue 5,1996
– Michalewicz
|
|
1
|
ImprovedSolutionsfor theChinesePostmanProblemon MixedNetworks
– Pearn
- 1999
|
|
1
|
Thimbleby,\`Lostin Hyperspace':PsychologicalProblemorBad Design," inFirstAsiaPaciflc Conference on Human Computer Interaction,L
– Theng
|
|
1
|
S.Wilf,Algorithmsand Complexity,Internet Edition,http://www.math.upenn.edu
– unknown authors
|
