1433 search results - page 84 / 287 » On Covering Problems of Rado |
165
click to vote
GECCO
2007
Springer
16 years 14 days ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
150
click to vote
APPROX
2004
Springer
15 years 11 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...
169
click to vote
CCGRID
2007
IEEE
16 years 20 days 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...
168
click to vote
ATMOS
2007
15 years 7 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...
152
click to vote
ALENEX
2001
15 years 7 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....