A Cutting Planes Algorithm for the m-Salesmen Problem

DOI10.2307/2581282MaRDI QIDQ3883900zbMATH OpenOpenAlexFDO

Authors G. Laporte, Yves Nobert

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

zbMATH Keywords

computational experiencecutting planes algorithminteger linear programmingm-salesmen problemtravelling salesman problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Cited in

(24)

• A cutting plane procedure for the travelling salesman problem on road networks
• A new class of cutting planes for the symmetric travelling salesman problem
• Transformation of multidepot multisalesmen problem to the standard travelling salesman problem
• Hamiltonian location problems
• Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem
• The \(m\)-Steiner traveling salesman problem with online edge blockages
• Hybrid search with neighborhood reduction for the multiple traveling salesman problem
• Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem
• 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 green vehicle routing problem with capacitated alternative fuel stations
• Integer linear programming formulations of multiple salesman problems and its variations
• Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach
• Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem
• Strategies for generating well centered tetrahedral meshes on industrial geometries
• 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
• The coastal seaspace patrol sector design and allocation problem
• Combining GLSP and ATSP approaches to lot sizing and sequencing in the production of animal feed supplements
• Memetic algorithm-based path generation for multiple Dubins vehicles performing remote tasks
• Synchronized traveling salesman problem
• Branch and cut methods for network optimization
• A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times
• Discrete gorilla troops optimization with two neighborhood searches for symmetric traveling salesman problem

This page was built for publication: A Cutting Planes Algorithm for the m-Salesmen Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3883900)