scientific article; zbMATH DE number 4012343

MaRDI QIDQ3762096zbMATH OpenFDO

Authors G. Laporte, Hélène Mercure

Publication date 1985

zbMATH Keywords

asymmetrical distance matrixbranch and boundinteger linear programnetwork flowrelaxationshortest Hamiltonian circuitTravelling Salesman Problem

Mathematics Subject Classification ID

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

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

Cited in

(7)

• Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
• A lower bound for the shortest Hamiltonean path in directed graphs
• Discrete/Binary approach
• A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem
• 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

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)