Revision as of 23:13, 14 July 2022 edit WalkingRadiance (talk \| contribs) Extended confirmed users 2,428 edits source to journal article added Tag: Visual edit ← Previous edit		Revision as of 23:14, 14 July 2022 edit undo WalkingRadiance (talk \| contribs) Extended confirmed users 2,428 edits NP hard 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 efficiently. The CARP is [[NP-hardness\|NP-hard]]. The CARP can be solved with combinatorial optimization including convex hulls.

Capacitated arc routing problem: Difference between revisions