Sciweavers

920 search results - page 44 / 184
» Generating Satisfiable Problem Instances
Sort
View
111
Voted
EOR
2007
90views more  EOR 2007»
15 years 19 days ago
Arc routing problems with time-dependent service costs
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
Mariam Tagmouti, Michel Gendreau, Jean-Yves Potvin
102
Voted
HAIS
2009
Springer
15 years 5 months ago
A Vehicle Routing Problem Solved by Agents
The main purpose of this study is to find out a good solution to the vehicle routing problem considering heterogeneous vehicles. This problem tries to solve the generation of paths...
Maria Belén Vaquerizo García
110
Voted
COR
2006
94views more  COR 2006»
15 years 22 days ago
A comparison of two different formulations for arc routing problems on mixed graphs
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
Angel Corberán, Enrique Mota, José M...
COR
2007
112views more  COR 2007»
15 years 20 days ago
The bi-objective covering tour problem
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
Nicolas Jozefowiez, Frédéric Semet, ...
85
Voted
ISAAC
2004
Springer
94views Algorithms» more  ISAAC 2004»
15 years 6 months ago
Error Compensation in Leaf Root Problems
The k-Leaf Root problem is a particular case of graph power problems. Here, we study “error correction” versions of k-Leaf Root—that is, for instance, adding or deleting at m...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...