Transforming arc routing into node routing problems
From MaRDI portal
Publication:1820685
DOI10.1016/0305-0548(87)90065-7zbMath0614.90060OpenAlexW2081814459MaRDI QIDQ1820685
Arjang A. Assad, Bruce L. Golden, Wen Lea Pearn
Publication date: 1987
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(87)90065-7
Related Items
A branch-and-bound algorithm for the time-dependent rural postman problem, Solving the time varying postman problems with timed automata, Improved bounds for large scale capacitated arc routing problem, Location-arc routing problem: heuristic approaches and test instances, A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows, Routing problems: A bibliography, Arc routing problems with time-dependent service costs, Modeling and solving the mixed capacitated general routing problem, Arc routing under uncertainty: introduction and literature review, New lower bounds for the Capacitated Arc Routing Problem, Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics, A Decade of Capacitated Arc Routing, Combinatorial optimization and green logistics, Workload equity in vehicle routing: the impact of alternative workload resources, Approximate solutions for the maximum benefit chinese postman problem, Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows, Combinatorial optimization and green logistics, Evolutionary algorithms for periodic arc routing problems, A constraint programming approach to the Chinese postman problem with time windows, New lower bound for the capacitated arc routing problem, Augment-insert algorithms for the capacitated arc routing problem, Recent results on Arc Routing Problems: An annotated bibliography, Exploiting sparsity in pricing routines for the capacitated arc routing problem, Lower bounds for the mixed capacitated arc routing problem, Exact approaches for the cutting path determination problem, A compact transformation of arc routing problems into node routing problems, Solving capacitated arc routing problems using a transformation to the CVRP, An integer programming approach for the Chinese postman problem with time-dependent travel time, The time-dependent rural postman problem: polyhedral results
Cites Work
