Sciweavers

3433 search results - page 202 / 687
» Heuristics for a bidding problem
Sort
View
HM
2005
Springer
98views Optimization» more  HM 2005»
16 years 4 days ago
A Hybrid GRASP with Data Mining for the Maximum Diversity Problem
Abstract. The maximum diversity problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
L. F. Santos, Marcos Henrique Ribeiro, Alexandre P...
EVOW
2004
Springer
16 years 8 hour ago
Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms
Cellular Genetic Algorithms (cGAs) are a subclass of Genetic Algorithms (GAs) in which the population diversity and exploration are enhanced thanks to the existence of small overla...
Enrique Alba, Bernabé Dorronsoro
PDP
2010
IEEE
15 years 12 months ago
A Parallel Preconditioned Conjugate Gradient Solver for the Poisson Problem on a Multi-GPU Platform
- We present a parallel conjugate gradient solver for the Poisson problem optimized for multi-GPU platforms. Our approach includes a novel heuristic Poisson preconditioner well sui...
Marco Ament, Günter Knittel, Daniel Weiskopf,...
193
Voted
CP
2001
Springer
15 years 11 months ago
A CLP Approach to the Protein Side-Chain Placement Problem
Abstract. Selecting conformations for side-chains is an important subtask in building three-dimensional protein models. Side-chain placement is a difficult problem because of the l...
Martin T. Swain, Graham J. L. Kemp
AI
1998
Springer
15 years 11 months ago
A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows
A variety of hybrid genetic algorithms has been recently proposed to address the vehicle routing problem with time windows (VRPTW), a problem known to be NP-hard. However, very few...
Jean Berger, Martin Salois, Regent Begin