Pages that link to "Item:Q1280545"
From MaRDI portal
The following pages link to An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs (Q1280545):
Displaying 11 items.
- A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem (Q505113) (← links)
- A random-key genetic algorithm for the generalized traveling salesman problem (Q858328) (← links)
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem (Q975992) (← links)
- Transformations of generalized ATSP into ATSP. (Q1400345) (← links)
- A two-level metaheuristic for the all colors shortest path problem (Q1616945) (← links)
- Generalized network design problems. (Q1810478) (← links)
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (Q2189879) (← links)
- Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics (Q2636833) (← links)
- Discrete/Binary Approach (Q3649626) (← links)
- A construction for directed in-out subgraphs of optimal size (Q4622626) (← links)
- A comprehensive survey on the generalized traveling salesman problem (Q6556079) (← links)
