A Cutting Planes Algorithm for the m-Salesmen Problem
From MaRDI portal
Publication:3883900
DOI10.2307/2581282zbMath0441.90067OpenAlexW4234818164MaRDI QIDQ3883900
Publication date: 1980
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2581282
integer linear programmingtravelling salesman problemcomputational experiencecutting planes algorithmm-salesmen problem
Related Items
Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem, Hybrid search with neighborhood reduction for the multiple traveling salesman problem, A memetic algorithm for the travelling salesperson problem with hotel selection, Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations, A new class of cutting planes for the symmetric travelling salesman problem, Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem, Synchronized Traveling Salesman Problem, Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach, Transformation of multidepot multisalesmen problem to the standard travelling salesman problem, Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries, The coastal seaspace patrol sector design and allocation problem, Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem, Hamiltonian location problems, Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal, Branch and cut methods for network optimization, A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times, Integer linear programming formulations of multiple salesman problems and its variations, An algorithm for mapping the asymmetric multiple traveling salesman problem onto colored Petri nets, Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm, The \(m\)-Steiner traveling salesman problem with online edge blockages, The green vehicle routing problem with capacitated alternative fuel stations, Memetic algorithm-based path generation for multiple Dubins vehicles performing remote tasks, A cutting plane procedure for the travelling salesman problem on road networks
