scientific article; zbMATH DE number 3335671
From MaRDI portal
Publication:5613007
Cited in
(23)- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
- An efficient composite heuristic for the symmetric generalized traveling salesman problem
- Approximation schemes for the generalized traveling salesman problem
- Generalized network design problems.
- From symmetry to asymmetry: generalizing TSP approximations by parametrization
- Exact approaches for the cutting path determination problem
- A combinatorial approach to the design of vaccines
- Particle swarm optimization-based algorithms for TSP and generalized TSP
- Watchman routes for lines and line segments
- Discrete/Binary approach
- Directed in-out graphs of optimal size
- Una aplicacion de la programacion dinamica en la utilizacion de una red de agencias
- A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem
- The reduction of the Pareto set of a special structure in bicriteria discrete problems
- From symmetry to asymmetry: generalizing TSP approximations by parametrization
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem
- Temperature field optimization for laser powder bed fusion as a traveling salesperson problem with history
- The traveling purchaser problem with stochastic prices: exact and approximate algorithms
- A comprehensive survey on the generalized traveling salesman problem
- A unifying framework for selective routing problems
- The non-disjoint clustered traveling salesperson problem
- An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
- A random-key genetic algorithm for the generalized traveling salesman problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5613007)