R \& D planning and the generalized assignment problem (Q1112722)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: R \& D planning and the generalized assignment problem |
scientific article; zbMATH DE number 4079158
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | R \& D planning and the generalized assignment problem |
scientific article; zbMATH DE number 4079158 |
Statements
R \& D planning and the generalized assignment problem (English)
0 references
1988
0 references
The R \& D planning problem is presented in both substantive and formal terms. The formal problem is embedded in a more general model - the generalized assignment problem. Approximate algorithms are given for the solution of the generalized assignment problem and some results of experimental tests are reported.
0 references
R \& D planning
0 references
generalized assignment
0 references
Approximate algorithms
0 references
experimental tests
0 references
0.8598461
0 references
0.8518107
0 references
0.8514441
0 references
0.8502364
0 references
0.8450536
0 references
0.8445518
0 references
0.84283453
0 references
