search query: @indexterm RESOURCE ALLOCATION / total: 426
reference: 230 / 426
| Author: | Eiselt, H. A. Laporte, G. |
| Title: | Combinatorial optimization problems with soft and hard requirements |
| Journal: | Journal of the Operational Research Society
1987 : SEP, VOL. 38:9, p.785-795 |
| Index terms: | HEURISTIC METHODS INTEGER PROGRAMMING RESOURCE ALLOCATION |
| Language: | eng |
| Abstract: | The heuristic principle described is particularly suited for problems where elements from on set are assigned to elements from a second set. These difficult problems are modelled and solved using examples like political districting, nurse scheduling, examination timetabling and course sectioning. In the latter case the solution is also provided. Within this general framework, specific algorithms must be developed, taking into account the structure of the problem to be solved. The examples illustrate that although there is no universal algorithm for the problems, they have common principles. |
SCIMA