The following pages link to (Q4252306):
Displaying 8 items.
- Long non-crossing configurations in the plane (Q603879) (← links)
- On the longest spanning tree with neighborhoods (Q777263) (← links)
- Simpler analysis of LP extreme points for traveling salesman and survivable network design problems (Q974982) (← links)
- The lazy bureaucrat scheduling problem (Q1398377) (← links)
- Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension (Q2162693) (← links)
- Asymptotically optimal algorithms for geometric MAX TSP and MAX \(m\)-PSP (Q2434738) (← links)
- Lengths of tours and permutations on a vertex set of a convex polygon. (Q5954238) (← links)
- A hybrid mathematical model for flying sidekick travelling salesman problem with time windows (Q6200792) (← links)
