Pages that link to "Item:Q6097759"

The following pages link to Results for the close-enough traveling salesman problem with a branch-and-bound algorithm (Q6097759):

Displaying 1 item.

• Facility location problems on graphs with non-convex neighborhoods (Q6047916) (← links)