27 search results - page 1 / 6 » A Greedy Randomized Adaptive Search Procedure for the Feedba... |
JCO
1998
13 years 4 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
WEA
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
ANOR
2002
13 years 4 months ago
2002
We present a Tabu Search (TS) method that employs a simple version of ejection chains for coloring graphs. The procedure is tested on a set of benchmark problems. Empirical result...
EOR
2010
13 years 4 months ago
2010
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
DAM
2000
13 years 4 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...