The k-cardinality assignment problem

Discrete Applied Mathematics

Volumn 76, Issue 1-3, 1997, Pages 103-121

  Dell'Amico, Mauro ^b   Martello, Silvano ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0043128724     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(97)00120-0     Document Type: Article

References (18)

1. R. Aboudi and G.L. Nemhauser, Some facets for an assignment problem with side constraints, Oper. Res. 39 (1991) 244-250.
2. V. Aggarwal, A Lagrangean-relaxation method for the constrained assignment problem, Comput. Oper. Res. 12 (1985) 97-106.
3. R.K. Ahuja, T.L. Magnanti and J.B. Orlin, Network Flows (Prentice-Hall, Englewood Cliffs, NJ, 1993).
4. D.P. Bertsekas and P. Tseng, The relax codes for linear minimum cost network flow problems, in: B. Simeone et al., Eds., Fortran Codes for Network Optimization, Annals of Operational Research, Vol. 13 (J.C. Baltzer AG, Basel, 1988) 125-190.
5. G. Caron, P. Hansen and B. Jaumard, The assignment problem with seniority and job priority constraints, Research Report, University of Friburg (1995).
6. G. Carpaneto, S. Martello and P. Toth, Algorithms and codes for the assignment problem, in: B. Simeone et al., Eds., Fortran Codes for Network Optimization, Annals of Operational Research, Vol. 13 (J.C. Baltzer AG, Basel, 1988) 193-223.
7. E.W. Dijkstra, A note on two problems in connection with graphs, Numer. Math. 1 (1959) 269-271.
8. M. Fischetti and S. Martello, A hybrid algorithm for finding the kth smallest of n elements in O(n) time, in: B. Simeone et al., Eds., Fortran Codes for Network Optimization, Annals of Operational Research, Vol. 13 (J.C. Baltzer AG, Basel, 1988) 401-419.
9. R. Jonker and T. Volgenant, A shortest augmenting path algorithm for dense and sparse linear assignment problems, Computing 38 (1987) 325-340.
10. J.L. Kennington and Z. Wang, An empirical analysis of the dense assignment problem: sequential and parallel implementations, ORSA J. Comput. 3 (1991) 299-306.
11. E.L. Lawler, Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976).
12. R.E. Machol and M. Wien, A hard assignment problem, Oper. Res. 24 (1976) 190.
13. S. Martello and P. Toth, Linear assignment problems, in: S. Martello et al., Eds., Surveys in Combinatorial Optimization, Annals of Discrete Mathematics, Vol. 31 (North-Holland, Amsterdam, 1987) 259-282.
14. J.B. Mazzola and A.W. Neebe, Resource-constrained assignment scheduling, Oper. Res. 34 (1986) 560-572.
15. G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization (Wiley, New York, 1988).
16. C.A. Pomalaza-Ráez, A note on efficient SS/TDMA assignment algorithms, IEEE Trans. Commun. 36 (1988) 1078-1082.
17. C. Prins, An overview of scheduling problems arising in satellite communications, J. Oper. Res. Soc. 45 (1994) 611-623.
18. D.J.A. Welsh, Matroid Theory (Academic Press, London, 1976).