16596 search results - page 454 / 3320 » Generalized Assignment Problems |
243
click to vote
IWOCA
2010
Springer
15 years 2 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
254
click to vote
CPAIOR
2011
Springer
14 years 11 months ago
2011
Springer
In this work we present the Partner Units Problem as a novel challenge for optimization methods. It captures a certain type of configuration problem that frequently occurs in indu...
184
click to vote
SODA
2012
ACM
13 years 10 months ago
2012
ACM
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
171
click to vote
ISSAC
2007
Springer
16 years 1 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
322
click to vote
LSSC
2007
Springer
16 years 1 months ago
2007
Springer
The Ant Colony Optimization (ACO) algorithms are being applied successfully to a wide range of problems. ACO algorithms could be good alternatives to existing algorithms for hard c...