16596 search results - page 174 / 3320 » Generalized Assignment Problems |
119
Voted
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
114
click to vote
IPPS
2000
IEEE
15 years 6 months ago
2000
IEEE
Previous studies showed that the cross-talk problem on the all-optical networks exists at both links and switches of the networks. To solve the cross-talk problem at both links and...
125
Voted
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
142
Voted
ACID
2006
15 years 3 months ago
2006
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practic...
93
Voted
APAL
2007
15 years 2 months ago
2007
We study generalizations of shortest programs as they pertain to Schaefer’s MIN∗ problem. We identify sets of m-minimal and T-minimal indices and characterize their truth-tabl...