scientific article; zbMATH DE number 1933055

zbMATH Open1107.90038MaRDI QIDQ4405643FDOQ4405643

Authors: G. Gutin, A. Yeo 

Publication date: 23 June 2003

Title of this publication is not available (Why is that?)

Recommendations

• An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs
• A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
• Some Applications of the Generalized Travelling Salesman Problem
• An Efficient Transformation Of The Generalized Traveling Salesman Problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem

zbMATH Keywords

Assignment problemTraveling Salesman Problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Cited In (4)

• Branch-and-bound for the precedence constrained generalized traveling salesman problem
• Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
• A discrete state transition algorithm for generalized traveling salesman problem
• A memetic 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 Q4405643)