Exact methods based on node-routing formulations for undirected arc-routing problems

DOI10.1002/net.20091zbMath1090.90030OpenAlexW2109622667WikidataQ59195746 ScholiaQ59195746MaRDI QIDQ3376660

Roberto Baldacci, Vittorio Maniezzo

Publication date: 24 March 2006

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20091

zbMATH Keywords

branch and cutvalid inequalitiesarc routingnode routing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Traffic problems in operations research (90B20)

Related Items

Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition, A hybrid metaheuristic approach for the capacitated arc routing problem, Improved bounds for large scale capacitated arc routing problem, Location-arc routing problem: heuristic approaches and test instances, Arc routing problems with time-dependent service costs, Arc routing under uncertainty: introduction and literature review, An improved multi-objective framework for the rich arc routing problem, Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems, Improved lower bounds and exact algorithm for the capacitated arc routing problem, Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics, A deterministic tabu search algorithm for the capacitated arc routing problem, A Decade of Capacitated Arc Routing, A variable neighborhood search for the capacitated arc routing problem with intermediate facilities, Combinatorial optimization and green logistics, Iterated local search and column generation to solve arc-routing as a permutation set-covering problem, Branch-price-and-cut for the mixed capacitated general routing problem with time windows, An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem, Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows, Combinatorial optimization and green logistics, 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, Tour splitting algorithms for vehicle routing problems, A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands, Robust drone selective routing in humanitarian transportation network assessment, Exact approaches for the cutting path determination problem, Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration, A compact transformation of arc routing problems into node routing problems

Uses Software

• CPLEX

Cites Work

• Unnamed Item