14548 search results - page 370 / 2910 » The Optimal Path-Matching Problem |
174
click to vote
EOR
2008
15 years 6 months ago
2008
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upp...
166
click to vote
MP
2006
15 years 6 months ago
2006
Stochastic programming is the subfield of mathematical programming that considers optimization in the presence of uncertainty. During the last four decades a vast amount of litera...
181
click to vote
CCE
2004
15 years 6 months ago
2004
We consider the dynamic optimization of chemical processes with changes in the number of equilibrium phases. Recent work has shown that transitions in the number of phases can be ...
194
click to vote
FLAIRS
2010
15 years 4 months ago
2010
The choice of a good annealing schedule is necessary for good performance of simulated annealing for combinatorial optimization problems. In this paper, we pose the simulated anne...
213
click to vote
IWPEC
2010
Springer
15 years 4 months ago
2010
Springer
RANK AGGREGATION is important in many areas ranging from web search over databases to bioinformatics. The underlying decision problem KEMENY SCORE is NP-complete even in case of fo...