206 search results - page 17 / 42 » A branch-and-bound algorithm for hard multiple knapsack prob... |
PPL
2010
14 years 4 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
94
Voted
EVOW
2009
Springer
15 years 2 months ago
2009
Springer
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
INFOCOM
2003
IEEE
15 years 2 months ago
2003
IEEE
Abstract— Finding a path in a network based on multiple constraints (the MCP problem) is often referred to as QoS routing. QoS routing with constraints on multiple additive metri...
174
click to vote
SIGMOD
2009
ACM
15 years 9 months ago
2009
ACM
Entity Resolution (ER) is an important real world problem that has attracted significant research interest over the past few years. It deals with determining which object descript...
78
Voted
RECOMB
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The objective function of the genome rearrangement problems allows the integration of other genome-level problems so that they may be solved simultaneously. Three example...