1547 search results - page 156 / 310 » Solving Knapsack Problems in a Sticker Based Model |
120
Voted
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
In the present article, we introduce a new method for identification of metabolic pathways in constraint based models that consider enzyme and substrate concentrations. It genera...
108
Voted
MASCOTS
2001
15 years 5 months ago
2001
This paper presents a tool for MPLS network dimensioning that allows for multi-hour dimensioning of networks supporting simultaneously peer-to-peer and client-server services. The...
109
Voted
EOR
2006
15 years 3 months ago
2006
The facility location problem described in this paper comes from an industrial application in the slaughterhouse industry of Norway. Investigations show that the slaughterhouse in...
151
Voted
CSCLP
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
139
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Genetic Algorithms (GAs) can efficiently produce high quality results for hard combinatorial real world problems such as the Vehicle Routing Problem (VRP). Genetic Vehicle Represe...