Pages that link to "Item:Q5236290"
From MaRDI portal
The following pages link to A time- and space-optimal algorithm for the many-visits TSP (Q5236290):
Displaying 4 items.
- High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system (Q2029029) (← links)
- Many-visits TSP revisited (Q2051856) (← links)
- Domino sequencing: scheduling with state-based sequence-dependent setup times (Q2294316) (← links)
- Approximate Counting of k-Paths: Deterministic and in Polynomial Space (Q5091173) (← links)
