An Efficient Transformation Of The Generalized Traveling Salesman Problem
From MaRDI portal
Publication:4202256
DOI10.1080/03155986.1993.11732212zbMath0774.90085MaRDI QIDQ4202256
James C. Bean, Charles E. Noon
Publication date: 1 September 1993
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2027.42/6833
90C35: Programming involving graphs or networks
90C10: Integer programming
90B06: Transportation, logistics and supply chain management
Related Items
A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal, A random-key genetic algorithm for the generalized traveling salesman problem, A way to optimally solve a time-dependent vehicle routing problem with time windows, An efficient composite heuristic for the symmetric generalized traveling salesman problem, On the generalized 2-peripatetic salesman problem, Modeling and solving several classes of arc routing problems as traveling salesman problems, Transformations of generalized ATSP into ATSP., Generalized spanning trees, Generalized network design problems., Routing problems: A bibliography, An efficient transformation of the generalized vehicle routing problem, Solving an urban waste collection problem using ants heuristics, An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation, A review of TSP based approaches for flowshop scheduling
