The k-cardinality assignment problem
- 1 June 1997
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 76 (1-3), 103-121
- https://doi.org/10.1016/s0166-218x(97)00120-0
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The Assignment Problem with Seniority and Job Priority ConstraintsOperations Research, 1999
- An Overview of Scheduling Problems Arising in Satellite CommunicationsJournal of the Operational Research Society, 1994
- An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel ImplementationsINFORMS Journal on Computing, 1991
- Some Facets for an Assignment Problem with Side ConstraintsOperations Research, 1991
- A note on efficient SS/TDMA assignment algorithmsIEEE Transactions on Communications, 1988
- A shortest augmenting path algorithm for dense and sparse linear assignment problemsComputing, 1987
- Resource-Constrained Assignment SchedulingOperations Research, 1986
- A Lagrangean-relaxation method for the constrained assignment problemComputers & Operations Research, 1985
- Technical Note—A “Hard” Assignment ProblemOperations Research, 1976
- A note on two problems in connexion with graphsNumerische Mathematik, 1959