Sciweavers

27 search results - page 2 / 6
» A hybrid approach to protein folding problem integrating con...
Sort
View
ANOR
2002
128views more  ANOR 2002»
13 years 4 months ago
Crew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search
The Airline Crew Assignment Problem (ACA) consists of assigning lines of work to a set of crew members such that a set of activities is partitioned and the costs for that assignmen...
Meinolf Sellmann, Kyriakos Zervoudakis, Panagiotis...
HM
2009
Springer
145views Optimization» more  HM 2009»
13 years 9 months ago
A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal + +
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
Raffaele Cipriano, Luca Di Gaspero, Agostino Dovie...
ANOR
2002
99views more  ANOR 2002»
13 years 4 months ago
A General Approach to the Physician Rostering Problem
Abstract. This paper presents a hybridization of a Constraint Programming (CP) model and search techniques with Local Search (LS) and some ideas borrowed from Genetic Algorithms (G...
Louis-Martin Rousseau, Gilles Pesant, Michel Gendr...
CPAIOR
2010
Springer
13 years 9 months ago
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
Timo Berthold, Stefan Heinz, Marco E. Lübbeck...
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
13 years 11 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng