scientific article; zbMATH DE number 4012343

zbMATH Open0623.90082MaRDI QIDQ3762096FDOQ3762096

Authors: G. Laporte, Hélène Mercure 

Publication date: 1985

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

Recommendations

• Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
• A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
• The traveling salesman problem. II: Exact methods
• The symmetric clustered traveling salesman problem
• Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations

zbMATH Keywords

network flowbranch and boundrelaxationinteger linear programTravelling Salesman Problemshortest Hamiltonian circuitasymmetrical distance matrix

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Integer programming (90C10) Eulerian and Hamiltonian graphs (05C45)

Cited In (6)

• A comprehensive survey on the generalized traveling salesman problem
• 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
• Discrete/Binary approach
• A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem
• Generalized travelling salesman problem through n sets of nodes: The asymmetrical case

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 Q3762096)