Pages that link to "Item:Q3452505"
From MaRDI portal
The following pages link to The geometric maximum traveling salesman problem (Q3452505):
Displaying 9 items.
- On the longest spanning tree with neighborhoods (Q777263) (← links)
- A quantization framework for smoothed analysis of Euclidean optimization problems (Q893320) (← links)
- On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours (Q924547) (← links)
- Multigraph realizations of degree sequences: Maximization is easy, minimization is hard (Q957360) (← links)
- Geometric versions of the three-dimensional assignment problem under general norms (Q1751127) (← links)
- Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension (Q2162693) (← links)
- An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles (Q2185648) (← links)
- Asymptotically optimal algorithms for geometric MAX TSP and MAX \(m\)-PSP (Q2434738) (← links)
- Winding indexes of Max. and Min. Hamiltonians in N-Gons (Q4595250) (← links)
