294 search results - page 7 / 59 » A hybrid metaheuristic approach to solving the UBQP problem |
COMPSAC
2004
IEEE
13 years 11 months ago
2004
IEEE
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
EMO
2009
Springer
14 years 2 months ago
2009
Springer
We propose an elitist Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic algorithm, called mGRASP/MH, for approximating the Pareto-optimal front in the multi-objecti...
GECCO
2011
Springer
12 years 11 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
BMCBI
2006
13 years 7 months ago
2006
Background: We consider the problem of parameter estimation (model calibration) in nonlinear dynamic models of biological systems. Due to the frequent ill-conditioning and multi-m...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
