scientific article; zbMATH DE number 3278972

zbMath0174.51305MaRDI QIDQ5563210

No author found.

Publication date: 1969

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

zbMATH Keywords

operations research

Related Items

On the generalized 2-peripatetic salesman problem, 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, Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems, Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule, The family traveling salesman problem with incompatibility constraints, Heuristic approaches for the family traveling salesman problem, A branch-and-cut algorithm for the generalized traveling salesman problem with time windows, The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods, Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm, The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm, A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem, A travelling salesman problem (TSP) with multiple job facilities., The linear ordering problem with cumulative costs, A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem, The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search, Solving the family traveling salesman problem, Truncated \(M\)-travelling salesman problem, Generalized network design problems., Generalized network design polyhedra, Discrete/Binary Approach, Finding the shortest path with vertex constraint over large graphs, 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, Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem