scientific article
From MaRDI portal
Publication:3762096
zbMath0623.90082MaRDI QIDQ3762096
Hélène Mercure, Gilbert Laporte
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
branch and boundrelaxationnetwork flowinteger linear programTravelling Salesman Problemshortest Hamiltonian circuitasymmetrical distance matrix
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05) Deterministic network models in operations research (90B10) Eulerian and Hamiltonian graphs (05C45)
Related Items (5)
Generalized travelling salesman problem through n sets of nodes: The asymmetrical case ⋮ 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 ⋮ A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem ⋮ Discrete/Binary Approach
This page was built for publication:
