Sciweavers

2 search results - page 1 / 1
» Multiple center capacitated arc routing problems: A tabu sea...
Sort
View
EOR
2000
102views more  EOR 2000»
13 years 4 months ago
Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
In the capacitated arc routing problem with multiple centers (M-CARP) the objective is to
Anita Amberg, Wolfgang Domschke, Stefan Voß
CIAC
2010
Springer
246views Algorithms» more  CIAC 2010»
13 years 8 months ago
Capacitated Confluent Flows: Complexity and Algorithms
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
Daniel Dressler and Martin Strehler