Topological and Computational Aspects of Preemptive Multicriteria Military Personnel Assignment Problems
| Year of publication: |
1984
|
|---|---|
| Authors: | Klingman, Darwin ; Phillips, Nancy V. |
| Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 30.1984, 11, p. 1362-1375
|
| Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
| Subject: | preemptive multicriteria | assignment | networks | manpower |
-
The complexity of computing the random priority allocation matrix
Saban, Daniela, (2015)
-
Polynomially solvable personnel rostering problems
Smet, Pieter, (2016)
-
The causal impact of social connections on firms' outcomes
Eliason, Marcus, (2017)
- More ...
-
klingman, Darwin, (1984)
-
New Polynomial Shortest Path Algorithms and Their Computational Attributes
Glover, Fred, (1985)
-
Finding equivalent network formulations for constrained network problems
Klingman, Darwin, (1977)
- More ...