Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach

DOI10.1080/03155986.1983.11731885zbMath0524.90069OpenAlexW108694910MaRDI QIDQ3037137

Gilbert Laporte, Yves Nobert

Publication date: 1983

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1983.11731885

zbMATH Keywords

computational resultsbranch and bound algorithmdegree constraintsinteger linear programsubtour eliminationshortest Hamiltonian cyclegeneralized travelling salesman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05)

Related Items

Generalized travelling salesman problem through n sets of nodes: The asymmetrical case, An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem, The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach, A random-key genetic algorithm for the generalized traveling salesman problem, Routing problems: A bibliography, Solving a generalized traveling salesperson problem with stochastic customers, Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems, Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout, Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule, An adaptive memory matheuristic for the set orienteering problem, Transformations of generalized ATSP into ATSP., New mathematical models of the generalized vehicle routing problem and extensions, The cumulative school bus routing problem: Polynomial‐size formulations, A classification scheme for vehicle routing and scheduling problems, An extremal constrained routing problem with internal losses, On an iterative procedure for solving a routing problem with constraints, Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants, A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem, The set orienteering problem, A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem, Algorithms for the design of network topologies with balanced disjoint rings, A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool, Generalized network design problems., The vehicle routing-allocation problem: A unifying framework, An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs, Discrete/Binary Approach, An efficient composite heuristic for the symmetric generalized traveling salesman problem, Optimization of Cartesian tasks with configuration selection, A taxonomical analysis, current methods and objectives on location-routing problems