Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Mixed Chinese postman problem (view)

searching for Chinese postman problem 6 found (17 total)

Snow plow routing problem (328 words) [view diff] case mismatch in snippet view article find links to article

cost of plowing downhill compared to plowing uphill. The Mixed Chinese Postman Problem is applicable to snow routes where directed edges represent one-way

Meigu Guan (605 words) [view diff] exact match in snippet view article find links to article

Jack Edmonds, who gave the problem its alternative name, the "Chinese postman problem", in honor of Guan, and proved that this problem can be solved

Branch and bound (2,432 words) [view diff] case mismatch in snippet view article find links to article

prediction in computer vision: 267–276 Arc routing problem, including Chinese Postman problem Talent Scheduling, scenes shooting arrangement problem Branch-and-bound

List of NP-complete problems (2,746 words) [view diff] exact match in snippet view article find links to article

minimum spanning tree: ND5 Route inspection problem (also called Chinese postman problem) for mixed graphs (having both directed and undirected edges).

Computational complexity (3,016 words) [view diff] case mismatch in snippet view article find links to article

implementation. Computational complexity of mathematical operations Chinese Postman Problem Complexity List Master theorem (analysis of algorithms) Vadhan

Graph theory (6,207 words) [view diff] exact match in snippet view article find links to article

Minimum spanning tree Route inspection problem (also called the "Chinese postman problem") Seven bridges of Königsberg Shortest path problem Steiner tree