{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T06:51:10Z","timestamp":1760424670371},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"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,12]]},"DOI":"10.1007\/bf02023003","type":"journal-article","created":{"date-parts":[[2005,8,10]],"date-time":"2005-08-10T13:49:15Z","timestamp":1123681755000},"page":"405-420","source":"Crossref","is-referenced-by-count":19,"title":["Tabu search applied to the general fixed charge problem"],"prefix":"10.1007","volume":"41","author":[{"given":"Minghe","family":"Sun","sequence":"first","affiliation":[]},{"given":"Patrick G.","family":"McKeown","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02023003_CR1","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1287\/mnsc.32.7.856","volume":"27","author":"A.V. Cabot","year":"1986","unstructured":"A.V. Cabot and S.S. Erenguc, Improved penalties for fixed charge problems using Lagrangian relaxation, Manag. Sci. 27(1986)856\u2013869.","journal-title":"Manag. Sci."},{"key":"BF02023003_CR2","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1287\/mnsc.15.9.550","volume":"15","author":"J.E. Falk","year":"1969","unstructured":"J.E. Falk and F.M. Soland, An algorithm for separable nonconvex programming problems, Manag. Sci. 15(1969)550\u2013569.","journal-title":"Manag. Sci."},{"key":"BF02023003_CR3","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"1","author":"F. Glover","year":"1986","unstructured":"F. Glover, Future paths for integer programming and links to artificial intelligence, Comp. Oper. Res. 1(1986)533\u2013549.","journal-title":"Comp. Oper. Res."},{"key":"BF02023003_CR4","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. Comp. 1(1989)190\u2013206.","journal-title":"ORSA J. Comp."},{"key":"BF02023003_CR5","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"F. Glover, Tabu search, Part II, ORSA J. Comp. 2(1990)4\u201332.","journal-title":"ORSA J. Comp."},{"key":"BF02023003_CR6","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1287\/inte.20.4.74","volume":"20","author":"F. Glover","year":"1990","unstructured":"F. Glover, Tabu search: A tutorial, Interfaces 20(1990)74\u201394.","journal-title":"Interfaces"},{"key":"BF02023003_CR7","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1002\/nav.3800280409","volume":"28","author":"P.G. McKeown","year":"1981","unstructured":"P.G. McKeown, A branch-and-bound algorithm for solving fixed charge problems, Naval Res. Log. 28(1981)607\u2013617.","journal-title":"Naval Res. Log."},{"key":"BF02023003_CR8","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0305-0548(90)90023-Z","volume":"17","author":"P.G. McKeown","year":"1990","unstructured":"P.G. McKeown and C.T. Ragsdale, A computational study of using preprocessing and stronger formulations to solve general fixed charge problems, Comp. Oper. Res. 17(1990)9\u201316.","journal-title":"Comp. Oper. Res."},{"key":"BF02023003_CR9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01720782","volume":"11","author":"D. Werra de","year":"1989","unstructured":"D. de Werra and A. Hertz, Tabu search techniques: A tutorial and an application to neural networks, OR Spektrum 11(1989)131\u2013141.","journal-title":"OR Spektrum"},{"key":"BF02023003_CR10","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1287\/mnsc.22.5.587","volume":"22","author":"W.E. Walker","year":"1976","unstructured":"W.E. Walker, An adjacent extreme point algorithm for the fixed charge problem, Manag. Sci. 22(1976)587\u2013596.","journal-title":"Manag. Sci."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02023003.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02023003\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02023003","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T22:39:56Z","timestamp":1557787196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02023003"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["BF02023003"],"URL":"https:\/\/doi.org\/10.1007\/bf02023003","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}