Add to ORKGSIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-24105 Kiel / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
In this paper we combine some results that are published elsewhere. We prove that tight upperbounds ...
The generalized assignment problem is a well-known NP-complete problem whose objective is to find a ...
ROSAT is a satellite borne X-ray observatory. Mission planning consists of scheduling up to half a y...
Abstract We examine the basis structure of the linear relaxation of the generalized assignment probl...
We consider a non-linear version of the Generalized Assignment Problem, a well-known strongly NP-har...
The generalized assignment problem is a topic of this thesis. The knapsack problem in general belong...
This paper presents a heuristic approach to solve the Generalized Assignment Problem (GAP) which is ...
Diese Doktorarbeit behandelt bekannte und neue Relaxationstechniken für das quadratische Zuordnungsp...
In this paper we discuss how assignment type mixed integer problems as they often occur in practical...
In this chapter we have described the state of the art in solving the Generalized Assignment Problem...
The Generalized Assignment Problem (GAP) is the problem of finding the minimal cost assignment of jo...
This paper discusses a heuristic for the generalized assignment problem (GAP). The objec-tive of GAP...
The research reported in this thesis considers the classical combinatorial optimization problem know...
AbstractThe traditional Generalized Assignment Problem (GAP) seeks an assignment of customers to fac...
In this thesis a method for solving the Generalized Assignment Problem (GAP) is described. It is bas...
In this paper we combine some results that are published elsewhere. We prove that tight upperbounds ...
The generalized assignment problem is a well-known NP-complete problem whose objective is to find a ...
ROSAT is a satellite borne X-ray observatory. Mission planning consists of scheduling up to half a y...
Abstract We examine the basis structure of the linear relaxation of the generalized assignment probl...
We consider a non-linear version of the Generalized Assignment Problem, a well-known strongly NP-har...
The generalized assignment problem is a topic of this thesis. The knapsack problem in general belong...
This paper presents a heuristic approach to solve the Generalized Assignment Problem (GAP) which is ...
Diese Doktorarbeit behandelt bekannte und neue Relaxationstechniken für das quadratische Zuordnungsp...
In this paper we discuss how assignment type mixed integer problems as they often occur in practical...
In this chapter we have described the state of the art in solving the Generalized Assignment Problem...
The Generalized Assignment Problem (GAP) is the problem of finding the minimal cost assignment of jo...
This paper discusses a heuristic for the generalized assignment problem (GAP). The objec-tive of GAP...
The research reported in this thesis considers the classical combinatorial optimization problem know...
AbstractThe traditional Generalized Assignment Problem (GAP) seeks an assignment of customers to fac...
In this thesis a method for solving the Generalized Assignment Problem (GAP) is described. It is bas...
In this paper we combine some results that are published elsewhere. We prove that tight upperbounds ...
The generalized assignment problem is a well-known NP-complete problem whose objective is to find a ...
ROSAT is a satellite borne X-ray observatory. Mission planning consists of scheduling up to half a y...