A cutting plane algorithm for the general routing problem

From MaRDI portal
Publication:5935711

DOI10.1007/s101070100219zbMath0989.90026MaRDI QIDQ5935711

José María Sanchis, Adam N. Letchford, Angel Corberán

Publication date: 7 August 2002

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)




Related Items (29)

The mixed capacitated general routing problem under uncertaintyTwo-phase branch-and-cut for the mixed capacitated general routing problemInteger programming formulation and polyhedral results for windy collaborative arc routing problemLower bounds and heuristics for the windy rural postman problemPricing routines for vehicle routing with time windows on road networksPolyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problemModeling and solving the mixed capacitated general routing problemA branch-and-cut algorithm for the maximum benefit Chinese postman problemVehicle routing on road networks: how good is Euclidean approximation?A note on computational aspects of the Steiner traveling salesman problemThe generalized arc routing problemOn approximate data reduction for the Rural Postman Problem: Theory and experimentsImproving a constructive heuristic for the general routing problemA branch-and-price algorithm for the windy rural postman problemThe periodic rural postman problem with irregular services on mixed graphsOn path-bridge inequalities for the orienteering arc routing problemsOn the general routing polytopeComputing finest mincut partitions of a graph and application to routing problemsThe Steiner traveling salesman problem and its extensionsA tabu search algorithm for the Min-Max \(k\)-Chinese postman problemRecent results on Arc Routing Problems: An annotated bibliographyOn the distance-constrained close enough arc routing problemA new integer programming formulation of the graphical traveling salesman problemSolving the close-enough arc routing problemA new integer programming formulation of the graphical traveling salesman problemAn asymptotically tight online algorithm for \(m\)-steiner traveling salesman problemNew facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problemSolving the prize-collecting rural postman problemHeuristics for the rural postman problem


Uses Software



This page was built for publication: A cutting plane algorithm for the general routing problem