1424 search results - page 78 / 285 » The Multi-radius Cover Problem |
89
Voted
APPROX
2004
Springer
15 years 6 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
108
click to vote
CCGRID
2007
IEEE
15 years 7 months ago
2007
IEEE
The Grid promise is starting to materialize today: largescale multi-site infrastructures have grown to assist the work of scientists from all around the world. This tremendous gro...
106
click to vote
ATMOS
2007
15 years 2 months ago
2007
We face a real-world train unit assignment problem for an operator running trains in a regional area. Given a set of timetabled train trips, each with a required number of passenge...
95
Voted
ALENEX
2001
15 years 2 months ago
2001
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
COR
2008
15 years 28 days ago
2008
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...