Revision as of 23:20, 14 July 2022 edit WalkingRadiance (talk \| contribs) Extended confirmed users 2,428 edits link to Large Scale Capacitated Arc Routing Problem added Tag: Visual edit ← Previous edit		Revision as of 00:07, 15 July 2022 edit undo WalkingRadiance (talk \| contribs) Extended confirmed users 2,428 edits hyperlink to arc routing problem added Tag: Visual edit Next edit →
Line 5: Solving the CARP involves the study of graph theory, arc routing, operations research, and geographical routing algorithms to find the [[Shortest path problem\|shortest path]] efficiently. The CARP is [[NP-hardness\|NP-hard]] [[arc routing problem]]. The CARP can be solved with combinatorial optimization including [[Convex hull\|convex hulls]].

Capacitated arc routing problem: Difference between revisions