scientific article; zbMATH DE number 3298367

zbMath0187.14002MaRDI QIDQ5578578

A. L. Henry-Labordere

Publication date: 1969

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computer science and automata

Related Items (29)

From symmetry to asymmetry: generalizing TSP approximations by parametrization ⋮ 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 ⋮ Particle swarm optimization-based algorithms for TSP and generalized TSP ⋮ Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm ⋮ A random-key genetic algorithm for the generalized traveling salesman problem ⋮ Approximation Algorithms for Generalized MST and TSP in Grid Clusters ⋮ The reduction of the Pareto set of a special structure in bicriteria discrete problems ⋮ The traveling purchaser problem with stochastic prices: exact and approximate algorithms ⋮ New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem ⋮ An extremal constrained routing problem with internal losses ⋮ Watchman routes for lines and line segments ⋮ On the complexity of the selective graph coloring problem in some special classes of graphs ⋮ On an iterative procedure for solving a routing problem with constraints ⋮ A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem ⋮ Approximation schemes for the generalized traveling salesman problem ⋮ A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem ⋮ From symmetry to asymmetry: generalizing TSP approximations by parametrization ⋮ The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search ⋮ 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 ⋮ Generalized network design problems. ⋮ A construction for directed in-out subgraphs of optimal size ⋮ Cluster-level operations planning for the out-of-position robotic arc-welding ⋮ Generalized network design polyhedra ⋮ Discrete/Binary Approach ⋮ Exact approaches for the cutting path determination problem ⋮ An efficient composite heuristic for the symmetric generalized traveling salesman problem ⋮ A combinatorial approach to the design of vaccines

This page was built for publication: