PP Petrushev… - 2011 - books.google.com CAMBRIDGE UNIVERSITY PRESS Cambridge, New York, Melbourne, Madrid, Cape Town, Singapore, Sao Paulo, Delhi, Dubai, Tokyo, Mexico City Cambridge University Press The Edinburgh Building, Cambridge CB2 8ru, UK Published in the United States of America by ... Cited by 231 - Related articles - All 9 versions
L Fleischer, MX Goemans… - Mathematics of …, 2011 - mor.journal.informs.org A separable assignment problem ( SAP ) is defined by a set of bins and a set of items to pack in each bin; a value, f ij , for assigning item j to bin i; and a separate packing constraint for each bin—ie, for each bin, a family of subsets of items that fit in to that bin. The goal is to pack ...
JH Jorgensen, ML McElmeel… - Journal of Clinical …, 2011 - Am Soc Microbiol Department of Pathology, University of Texas Health Science Center, San Antonio, TX,1 8 Respiratory Diseases Branch, Centers for Disease Control and Prevention, Atlanta, GA,2 and 9 Minnesota Department of Health, St. Paul, MN5. 10 ... James H. Jorgensen, Ph.D. 12 Department of ...
[PDF] from cornell.eduDP Williamson… - 2011 - books.google.com The Design of Approximation Algorithms Discrete optimization problems are everywhere, from traditional operations research plan- ning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral ... Cited by 36 - Related articles - All 5 versions