{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T23:20:49Z","timestamp":1771456849587,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bf00132504","type":"journal-article","created":{"date-parts":[[2004,11,4]],"date-time":"2004-11-04T04:15:04Z","timestamp":1099541704000},"page":"343-358","source":"Crossref","is-referenced-by-count":35,"title":["General purpose heuristics for integer programming?Part I"],"prefix":"10.1007","volume":"2","author":[{"given":"Fred","family":"Glover","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Laguna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"CR1","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/ijoc.6.1.82","volume":"6","author":"R. Aboudi","year":"1994","unstructured":"Aboudi, R. and K.J\u00f6rnsten. (1994). ?Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic,? ORSA Journal on Computing 6(1), 82?93.","journal-title":"ORSA Journal on Computing"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E. Balas","year":"1971","unstructured":"Balas, E. (1971). ?The Intersection Cut?A New Cutting Plane for Integer Programming,? Operations Research 19, 19?39.","journal-title":"Operations Research"},{"key":"CR3","unstructured":"Beasley, J.E. (1996). Advances in Linear and Integer Programming. Oxford Science Publications."},{"issue":"3","key":"CR4","first-page":"131","volume":"6","author":"F. Glover","year":"1964","unstructured":"Glover, F. (1964). ?A Bound Escalation Method for the Solution of Integer Linear Programs,? Cahiers de Recherche Op\u00e9rationelle 6(3), 131?168.","journal-title":"Cahiers de Recherche Op\u00e9rationelle"},{"issue":"1","key":"CR5","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/BF01584977","volume":"3","author":"F. Glover","year":"1972","unstructured":"Glover, F. (1972). ?Cut Search Methods in Integer Programming,? Mathematical Programming 3(1), 86?100.","journal-title":"Mathematical Programming"},{"key":"CR6","unstructured":"Glover, F. and A. L\u00f8kketangen. (1996). ?Solving Zero-One Mixed Integer Programming Problems Using Tabu Search,? in European Journal of Operational Research (to appear)."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Glover, F. and M. Laguna. (1997). Tabu Search. Kluwer Academic Publishers (forthcoming).","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1073\/pnas.53.2.260","volume":"53","author":"R.E. Gomory","year":"1965","unstructured":"Gomory, R.E. (1965). ?On the Relation between Integer and Non-Integer Solutions to Linear Programs.? Proceedings of the National Academy of Science, vol. 53, pp. 260?265.","journal-title":"Proceedings of the National Academy of Science"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1073\/pnas.57.1.16","volume":"57","author":"R.E. Gomory","year":"1967","unstructured":"Gomory, R.E. (1967). ?Faces of an Integer Polyhedron.? Proceedings of the National Academy of Science, vol. 57, pp. 16?18.","journal-title":"Proceedings of the National Academy of Science"},{"key":"CR10","series-title":"Research Memorandum RM-2597","volume-title":"An Algorithm for the Mixed Integer Problems","author":"R.E. Gomory","year":"1996","unstructured":"Gomory, R.E. (1996). ?An Algorithm for the Mixed Integer Problems,? Research Memorandum RM-2597, Rand Corporation, Santa Monica."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01584976","volume":"3","author":"R.E. Gomory","year":"1972","unstructured":"Gomory, R.E. and E.L.Johnson. (1972). ?Some Continuous Functions Related to Corner Polyhedra,? Mathematical Programming 3, 23?85.","journal-title":"Mathematical Programming"},{"key":"CR12","first-page":"123","volume-title":"Mathematical Programming for Industrial Engineers","author":"T.M. Magee","year":"1996","unstructured":"Magee, T.M. and F.Glover. (1996). ?Integer Programming.? In M.Avriel and B.Golany (eds.), Mathematical Programming for Industrial Engineers. New York: Marcel Dekker, Inc., pp. 123?270."},{"key":"CR13","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser, G.L. and L.A.Wolsey. (1988). Integer and Combinatorial Optimization. New York: John Wiley & Sons."},{"key":"CR14","volume-title":"Discrete Optimization","author":"G. Parker","year":"1988","unstructured":"Parker, G. and R.Rardin. (1988). Discrete Optimization. New York: Academic Press."},{"issue":"5","key":"CR15","first-page":"49","volume":"22","author":"R. Sharda","year":"1995","unstructured":"Sharda, R. (1995). ?Linear Programming Solver Software for Personal Computers: 1995 report,? OR\/MS Today 22(5), 49?51.","journal-title":"OR\/MS Today"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01581626","volume":"19","author":"H.D. Sherali","year":"1980","unstructured":"Sherali, H.D. and C.M.Shetty. (1980). ?A Finitely Convergent Algorithm for Bilinear Programming Problems Using Polar Cuts and Disjunctive Face Cuts,? Mathematical Programming 19, 14?31.","journal-title":"Mathematical Programming"},{"key":"CR17","unstructured":"Tuy, H. (1964). ?Concave Programming Under Linear Constraints,? Soviet Mathematics, pp. 1437?1440."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"1393","DOI":"10.1287\/opre.19.6.1393","volume":"19","author":"R.D. Young","year":"1971","unstructured":"Young, R.D. (1971). ?Hypercylindrically Deduced Cuts in Zero-One Integer Programming,? Operations Research 19, 1393?1405.","journal-title":"Operations Research"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00132504.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00132504\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00132504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T10:22:31Z","timestamp":1554286951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00132504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1997]]}},"alternative-id":["BF00132504"],"URL":"https:\/\/doi.org\/10.1007\/bf00132504","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}