1332 search results - page 155 / 267 » Combinatorial Algorithms |
118
click to vote
CPAIOR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...
107
click to vote
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
136
click to vote
CPAIOR
2008
Springer
15 years 4 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
147
click to vote
CONSTRAINTS
2008
15 years 2 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
127
click to vote
MOR
2000
15 years 2 months ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...