Pages that link to "Item:Q396660"
From MaRDI portal
The following pages link to Improved approximations for TSP with simple precedence constraints (Q396660):
Displaying 7 items.
- On residual approximation in solution extension problems (Q1631675) (← links)
- A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows (Q2147032) (← links)
- The parameterized approximability of TSP with deadlines (Q2464332) (← links)
- A priori TSP in the Scenario Model (Q2971168) (← links)
- Constrained TSP and low-power computing (Q5096929) (← links)
- Improved approximations for ordered TSP on near-metric graphs (Q5248874) (← links)
- Multi-candidate carpooling routing problem and its approximation algorithms (Q6606200) (← links)