Pages that link to "Item:Q1886800"
From MaRDI portal
The following pages link to On the complexity of the \(k\)-customer vehicle routing problem (Q1886800):
Displaying 7 items.
- Differential approximation algorithm of FSMVRP (Q277103) (← links)
- Minimum-weight cycle covers and their approximability (Q1028118) (← links)
- Greedy cycles in the star graphs (Q1669899) (← links)
- A framing link based tabu search algorithm for large-scale multidepot vehicle routing problems (Q1717769) (← links)
- An approximation algorithm for the traveling tournament problem (Q1761909) (← links)
- Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route (Q2261716) (← links)
- Minimum-Weight Cycle Covers and Their Approximability (Q3508566) (← links)
