16596 search results - page 70 / 3320 » Generalized Assignment Problems |
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
COR
2007
14 years 9 months ago
2007
This paper presents an algorithm for the unconstrained two-dimensional cutting problem of rectangular pieces. It proposes the two-stage general block pattern that can be cut into ...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
This paper proposes a general solution model using agent technology in order to solve two critical open issues in the course timetabling problem: application-specific issues and d...
ESA
2010
Springer
14 years 11 months ago
2010
Springer
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
COR
2010
14 years 10 months ago
2010
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represent...