An updated annotated bibliography on arc routing problems
The number of arc routing publications has increased significantly in the last decade. Such
an increase justifies a second annotated bibliography, a sequel to Corberán and Prins …
an increase justifies a second annotated bibliography, a sequel to Corberán and Prins …
A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: Theory and experiments
We prove that any polynomial‐time‐approximation algorithm for the n‐vertex metric
asymmetric Traveling Salesperson Problem yields a polynomial‐time‐approximation …
asymmetric Traveling Salesperson Problem yields a polynomial‐time‐approximation …
The mixed Chinese postman problem parameterized by pathwidth and treedepth
In the mixed Chinese postman problem (MCPP), given a weighted mixed graph G (it may
have both edges and arcs), our aim is to find a closed walk of minimum weight traversing …
have both edges and arcs), our aim is to find a closed walk of minimum weight traversing …
Automatic parameter tuning using bayesian optimization method
C Huang, B Yuan, Y Li, X Yao - 2019 IEEE Congress on …, 2019 - ieeexplore.ieee.org
The Capacitated Arc Routing Problem (CARP) is an essential and challenging problem in
smart logistics. Parameter tuning is commonly encountered in designing and applying …
smart logistics. Parameter tuning is commonly encountered in designing and applying …
[HTML][HTML] Rural Postman parameterized by the number of components of required edges
Abstract In the Directed Rural Postman Problem (DRPP), given a strongly connected
directed multigraph D=(V, A) with nonnegative integral weights on the arcs, a subset R of …
directed multigraph D=(V, A) with nonnegative integral weights on the arcs, a subset R of …
Efficient algorithms for Eulerian extension and rural postman
F Dorn, H Moser, R Niedermeier, M Weller - SIAM Journal on Discrete …, 2013 - SIAM
The aim of directed Eulerian extension problems is to make a given directed, possibly arc-
weighted,(multi-) graph Eulerian by adding a minimum-cost set of arcs. These problems …
weighted,(multi-) graph Eulerian by adding a minimum-cost set of arcs. These problems …
[HTML][HTML] Chinese Postman Problem on edge-colored multigraphs
It is well-known that the Chinese Postman Problem on undirected and directed graphs is
polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in …
polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in …
Fixed-parameter algorithms for maximum-profit facility location under matroid constraints
We consider an uncapacitated discrete facility location problem where the task is to decide
which facilities to open and which clients to serve for maximum profit so that the facilities …
which facilities to open and which clients to serve for maximum profit so that the facilities …
Parameterized algorithms and data reduction for the short secluded s‐t‐path problem
Given a graph G=(V, E), two vertices s, t∈ V, and two integers k, ℓ, the Short Secluded Path
problem is to find a simple s‐t‐path with at most k vertices and ℓ neighbors. We study the …
problem is to find a simple s‐t‐path with at most k vertices and ℓ neighbors. We study the …
Constant-factor approximations for capacitated arc routing without triangle inequality
Given an undirected graph with edge costs and edge demands, the Capacitated Arc Routing
problem (CARP) asks for minimum-cost routes for equal-capacity vehicles so as to satisfy all …
problem (CARP) asks for minimum-cost routes for equal-capacity vehicles so as to satisfy all …