STRONGLY POLYNOMIAL ALGORITHMS FOR THE HIGH MULTIPLICITY SCHEDULING PROBLEM

Research output: Contribution to journal › Article › peer-review

Cite this

@article{97e4246961984a7597661e317d0ed53a,

title = "STRONGLY POLYNOMIAL ALGORITHMS FOR THE HIGH MULTIPLICITY SCHEDULING PROBLEM",

author = "DS HOCHBAUM and Ron Shamir",

year = "1991",

language = "אנגלית",

volume = "39",

pages = "648--653",

journal = "Operations Research",

issn = "0030-364X",

publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",

number = "4",

}