Exact methods based on node-routing formulations for undirected arc-routing problems
From MaRDI portal
Publication:3376660
DOI10.1002/net.20091zbMath1090.90030WikidataQ59195746 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
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B20: Traffic problems in operations research
Related Items
Combinatorial optimization and green logistics, Combinatorial optimization and green logistics, 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, 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, A deterministic tabu search algorithm for the capacitated arc routing problem, A variable neighborhood search for the capacitated arc routing problem with intermediate facilities, Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows, Exploiting sparsity in pricing routines for the capacitated arc routing problem, Lower bounds for the mixed capacitated arc routing problem, A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands, Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration, Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics, 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, Improved lower bounds and exact algorithm for the capacitated arc routing problem, Robust drone selective routing in humanitarian transportation network assessment, Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition, Exact approaches for the cutting path determination problem, A compact transformation of arc routing problems into node routing problems, Arc routing under uncertainty: introduction and literature review, Recent results on Arc Routing Problems: An annotated bibliography, Tour splitting algorithms for vehicle routing problems, A Decade of Capacitated Arc Routing
Uses Software
Cites Work
