Pages that link to "Item:Q2660410"
From MaRDI portal
The following pages link to A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem (Q2660410):
Displaying 12 items.
- Approximating TSP walks in subcubic graphs (Q2101165) (← links)
- Two-machine routing open shop: How long is the optimal makespan? (Q2117636) (← links)
- From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q2140484) (← links)
- Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints (Q2169436) (← links)
- Approximation algorithms for some min-max postmen cover problems (Q2241210) (← links)
- The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable (Q2661637) (← links)
- Reinforcement learning for combinatorial optimization: a survey (Q2669503) (← links)
- Approximation algorithms for multi-vehicle stacker crane problems (Q2687683) (← links)
- SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition (Q5104667) (← links)
- On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
- From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q6098151) (← links)
- Ailsa H. Land and her 1979 study of the traveling salesman problem: personal reminiscences and historical remarks (Q6169990) (← links)
