Arc Routing Problems, Part II: The Rural Postman Problem
From MaRDI portal
Publication:4861354
DOI10.1287/opre.43.3.399zbMath0853.90042WikidataQ60895216 ScholiaQ60895216MaRDI QIDQ4861354
Michel Gendreau, Gilbert Laporte, H. A. Eiselt
Publication date: 6 January 1997
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.43.3.399
90C35: Programming involving graphs or networks
90B06: Transportation, logistics and supply chain management
Related Items
Differential approximation of NP-hard problems with equal size feasible solutions, Approximate solutions for the maximum benefit chinese postman problem, A taboo search heuristic for the optimisation of a multistage component placement system, The Rural Postman Problem on mixed graphs with turn penalties, Modeling the Pre Auction Stage The Truckload Case, A survey of models and algorithms for winter road maintenance. III: Vehicle routing and depot location for spreading, A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal, Lower bounds and heuristics for the windy rural postman problem, Using mixed integer programming for solving the capacitated arc routing problem with vehicle/site dependencies with an application to the routing of residential sanitation collection vehicles, Arc routing problems with time-dependent service costs, Heuristics for a dynamic rural postman problem, Undirected postman problems with zigzagging option: a cutting-plane approach, The school bus routing problem: a review, Lower bounds for the mixed capacitated arc routing problem, Heuristic methods for the sectoring arc routing problem, Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration, Heuristics for the rural postman problem, New inequalities for the general routing problem, The rural postman problem with deadline classes, The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra, Modeling and solving several classes of arc routing problems as traveling salesman problems, A heuristic algorithm based on Monte Carlo methods for the rural postman problem., Planning models for long-haul operations of postal and express shipment companies, Districting for salt spreading operations, ARC: A computerized system for urban garbage collection, The general routing polyhedron: A unifying framework, A GRASP heuristic for the mixed Chinese postman problem, A cutting plane algorithm for the capacitated arc routing problem, A guided local search heuristic for the capacitated arc routing problem, A heuristic for the periodic rural postman problem, Heuristic method for a mixed capacitated arc routing problem: A refuse collection application, Routing problems: A bibliography, Lower-bounding and heuristic methods for a refuse collection vehicle routing problem, An algorithm for the hierarchical Chinese postman problem, An efficient transformation of the generalized vehicle routing problem, New heuristic algorithms for the windy rural postman problem, Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems, A comparison of two different formulations for arc routing problems on mixed graphs, A constructive heuristic for the undirected rural postman problem, On the hierarchical Chinese postman problem with linear ordered classes, Solving capacitated arc routing problems using a transformation to the CVRP, The capacitated arc routing problem with intermediate facilities
