16404 search results - page 403 / 3281 » A set coverage problem |
215
click to vote
CP
1998
Springer
15 years 11 months ago
1998
Springer
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
179
click to vote
ICALP
1998
Springer
15 years 11 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
202
click to vote
LION
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Algorithm selection is typically based on models of algorithm performance learned during a separate offline training sequence, which can be prohibitively expensive. In r...
134
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
The facility positioning3 problem concerns the location of facilities such as bus-stops, fire stations, schools, so as to optimize one or several objectives. This paper contributes...
193
click to vote
SODA
2007
ACM
15 years 8 months ago
2007
ACM
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...