16596 search results - page 74 / 3320 » Generalized Assignment Problems |
105
click to vote
DISOPT
2010
14 years 10 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
114
click to vote
PEPM
1995
ACM
15 years 1 months ago
1995
ACM
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the class...
CCCG
2007
14 years 11 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
105
click to vote
PPSN
2010
Springer
14 years 8 months ago
2010
Springer
We present a hybrid Genetic Algorithm that incorporates the Generalized Partition Crossover (GPX) operator to produce an algorithm that is competitive with the state of the art for...