13 search results - page 1 / 3 » Maximum stable set formulations and heuristics based on cont... |
MP
2002
13 years 5 months ago
2002
The stability number (G) for a given graph G is the size of a maximum stable set in G. The Lov
TCBB
2008
13 years 5 months ago
2008
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
JGO
2010
13 years 4 months ago
2010
Abstract. Global optimization seeks a minimum or maximum of a multimodal function over a discrete or continuous domain. In this paper, we propose a hybrid heuristic – based on th...
TASE
2010
IEEE
13 years 7 days ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
ATMOS
2010
13 years 4 months ago
2010
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...