1090 search results - page 34 / 218 » Priority Algorithms for Graph Optimization Problems |
GECCO
2009
Springer
14 years 5 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
ECRTS
1998
IEEE
14 years 2 months ago
1998
IEEE
This paper introduces improvements in partitioning schemes for multiprocessor real-time systems which allow higher processor utilization and enhanced schedulability by using exact...
EOR
2008
13 years 10 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
JAL
2006
13 years 10 months ago
2006
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
IPCO
2008
13 years 11 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...