Pages that link to "Item:Q2294052"
From MaRDI portal
The following pages link to Covering tours and cycle covers with turn costs: hardness and approximation (Q2294052):
Displaying 5 items.
- Approximating the Minimum Tour Cover with a Compact Linear Program (Q3192959) (← links)
- Minimum Scan Cover with Angular Transition Costs (Q4997133) (← links)
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (Q5084594) (← links)
- What goes around comes around: covering tours and cycle covers with turn costs (Q6635695) (← links)
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization (Q6665386) (← links)