A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
From MaRDI portal
Publication:3980516
DOI10.1287/opre.39.4.623zbMath0741.90086OpenAlexW2067061580MaRDI QIDQ3980516
Charles E. Noon, James C. Bean
Publication date: 26 June 1992
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2027.42/6835
Lagrangian relaxationbranch-and-boundasymmetric Generalized Traveling Salesman Problemminimum cost \(m\)-arc directed cycle
Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
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, GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem, Routing problems: A bibliography, Motion planning algorithms for the Dubins Travelling Salesperson Problem, A branch-and-cut algorithm for the generalized traveling salesman problem with time windows, Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem, Household-Level Economies of Scale in Transportation, New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem, Transformations of generalized ATSP into ATSP., New mathematical models of the generalized vehicle routing problem and extensions, Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem, An efficient transformation of the generalized vehicle routing problem, Branch-and-bound for the precedence constrained generalized traveling salesman problem, ACS-TS: Train scheduling using ant colony system, 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, A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool, Approximation algorithms for group prize-collecting and location-routing problems, Routing heuristics for automated pick and place machines, Generalized network design problems., Cluster-level operations planning for the out-of-position robotic arc-welding, An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs, Discrete/Binary Approach, Vehicle routing with stochastic demands and restricted failures, A model for warehouse order picking, An efficient composite heuristic for the symmetric generalized traveling salesman problem, A review of TSP based approaches for flowshop scheduling, Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with intermediate facilities
