scientific article; zbMATH DE number 2064416
From MaRDI portal
Publication:4461915
zbMath1113.90352MaRDI QIDQ4461915
Paolo Toth, Juan-José Salazar-González, Matteo Fischetti
Publication date: 18 May 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines, Locating median cycles in networks, A survey of variants and extensions of the location-routing problem, Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics, A novel discretization scheme for the close enough traveling salesman problem, Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems, Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems, Location‐routing problem: a classification of recent research, Transformations of generalized ATSP into ATSP., A unified matheuristic for solving multi-constrained traveling salesman problems with profits, Cut-and-solve: An iterative search strategy for combinatorial optimization problems, An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits, ACS-TS: Train scheduling using ant colony system, The traveling purchaser problem and its variants, A memetic algorithm for the generalized traveling salesman problem, The pyramidal capacitated vehicle routing problem, Locating a cycle in a transportation or a telecommunications network, Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics, Approximation algorithms for group prize-collecting and location-routing problems, A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem, Compact formulations of the Steiner traveling salesman problem and related problems, Order sequencing on a unidirectional cyclical picking line
