Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
From MaRDI portal
Publication:1096550
DOI10.1016/0166-218X(87)90020-5zbMath0633.90087MaRDI QIDQ1096550
Yves Nobert, Hélène Mercure, Gilbert Laporte
Publication date: 1987
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
branch and boundexact algorithmComputational resultsTravelling Salesmanasymmetrical casegeneralized versionshortest Hamiltonian circuit
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Integer programming (90C10) Linear programming (90C05)
Related Items
A two-level metaheuristic for the all colors shortest path problem, An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem, Dealing with time in the multiple traveling salespersons problem with moving targets, Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm, A random-key genetic algorithm for the generalized traveling salesman problem, The bi-objective insular traveling salesman problem with maritime and ground transportation costs, Solving a generalized traveling salesperson problem with stochastic customers, Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems, Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule, The traveling purchaser problem with stochastic prices: exact and approximate algorithms, Transformations of generalized ATSP into ATSP., The Tube Challenge, A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems, The stable marriage problem: an interdisciplinary review from the physicist's perspective, Branch-and-bound for the precedence constrained generalized traveling salesman problem, A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem, Approximation schemes for the generalized traveling salesman problem, A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem, The Multiple Traveling Salesmen Problem with Moving Targets and Nonlinear Trajectories, Approximation algorithms for group prize-collecting and location-routing problems, Cluster-level operations planning for the out-of-position robotic arc-welding, Discrete/Binary Approach, An efficient composite heuristic for the symmetric generalized traveling salesman problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
- Optimal tour planning with specified nodes
- Technical Note—Bounds for the Travelling-Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
