{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T11:16:22Z","timestamp":1720696582559},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1007\/bf02022563","type":"journal-article","created":{"date-parts":[[2005,8,12]],"date-time":"2005-08-12T11:23:28Z","timestamp":1123845808000},"page":"69-84","source":"Crossref","is-referenced-by-count":30,"title":["Large-scale controlled rounding using tabu search with strategic oscillation"],"prefix":"10.1007","volume":"41","author":[{"given":"James P.","family":"Kelly","sequence":"first","affiliation":[]},{"given":"Bruce L.","family":"Golden","sequence":"additional","affiliation":[]},{"given":"Arjang A.","family":"Assad","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02022563_CR1","first-page":"91","volume-title":"Infinite and Finite Sets, Vol. 1","author":"Z. Baranyai","year":"1975","unstructured":"Z. Baranyai, On the factorization of the complete uniform hypergraph,Infinite and Finite Sets, Vol. 1, ed. A. Hajnal, R. Rado and V. Sos (North-Holland, Amsterdam, 1975) pp. 91\u201398."},{"key":"BF02022563_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02288322","volume":"13","author":"D.P. Bertsekas","year":"1988","unstructured":"D.P. Bertsekas and P. Tseng, The relax codes for linear minimum cost network flow problems, Ann. Oper. Res. 13(1988)125\u2013190.","journal-title":"Ann. Oper. Res."},{"key":"BF02022563_CR3","first-page":"423","volume":"20","author":"L.H. Cox","year":"1982","unstructured":"L.H. Cox and L.R. Ernst, Controlled rounding, INFOR 20(1982)423\u2013432.","journal-title":"INFOR"},{"key":"BF02022563_CR4","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02216926","volume":"20","author":"L.H. Cox","year":"1989","unstructured":"L.H. Cox and J.A. George, Controlled rounding for tables with subtotals, Ann. Oper. Res. 20(1989)141\u2013157.","journal-title":"Ann. Oper. Res."},{"key":"BF02022563_CR5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1080\/01621459.1972.10481199","volume":"67","author":"I.P. Fellegi","year":"1972","unstructured":"I.P. Fellegi, On the question of statistical confidentiality, J. Amer. Statis. Assoc. 67(1972)7\u201318.","journal-title":"J. Amer. Statis. Assoc."},{"key":"BF02022563_CR6","unstructured":"J.T. Fagan, B.V. Greenberg and R.J. Hemmig, Controlled rounding of three-dimensional tables, Bureau of the Census, Statistical Research Division Report Series, Census\/SRD(RR-88\/02 (1988)."},{"key":"BF02022563_CR7","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F. Glover","year":"1977","unstructured":"F. Glover, Heuristics for integer programming using surrogate constraints, Dec. Sci. 8(1977)156\u2013166.","journal-title":"Dec. Sci."},{"key":"BF02022563_CR8","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"F. Glover, Tabu Search, Part I, ORSA J. Comput. 1(1989)190\u2013206.","journal-title":"ORSA J. Comput."},{"key":"BF02022563_CR9","volume-title":"Protecting confidentiality in two- and three-dimensional tables","author":"J.P. Kelly","year":"1990","unstructured":"J.P. Kelly, Protecting confidentiality in two- and three-dimensional tables, Ph.D. Dissertation, Mathematics Department, University of Maryland, College Park, MD (1990)."},{"key":"BF02022563_CR10","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01719708","volume":"12","author":"J.P. Kelly","year":"1990","unstructured":"J.P. Kelly, A.A. Assad and B.L. Golden, The controlled rounding problem: Relaxations and complexity issues, OR Spektrum 12(1990)129\u2013138.","journal-title":"OR Spektrum"},{"key":"BF02022563_CR11","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1287\/ijoc.2.2.174","volume":"2","author":"J.P. Kelly","year":"1990","unstructured":"J.P. Kelly, B.L. Golden and A.A. Assad, Using simulated annealing to solve controlled rounding problems, ORSA J. Comput. 2(1990)174\u2013185.","journal-title":"ORSA J. Comput."},{"key":"BF02022563_CR12","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1287\/opre.38.5.760","volume":"38","author":"J.P. Kelly","year":"1990","unstructured":"J.P. Kelly, B.L. Golden, A.A. Assad and E.K. Baker, Controlled rounding of tabular data, Oper. Res. 38(1990)760\u2013772.","journal-title":"Oper. Res."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02022563.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02022563\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02022563","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T22:39:49Z","timestamp":1557787189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02022563"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["BF02022563"],"URL":"https:\/\/doi.org\/10.1007\/bf02022563","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}