{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T01:43:52Z","timestamp":1764812632456,"version":"3.41.2"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1997,9]]},"DOI":"10.1023\/a:1008621204567","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T10:12:40Z","timestamp":1040551960000},"page":"151-172","source":"Crossref","is-referenced-by-count":22,"title":["Generating Cuts from Surrogate Constraint Analysis for Zero-One and Multiple Choice Programming"],"prefix":"10.1007","volume":"8","author":[{"given":"Fred","family":"Glover","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youngho","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"136836_CR1","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E. Balas","year":"1975","unstructured":"E. Balas, \"Facets of the knapsack polytope,\" Mathematical Programming, vol. 8, pp. 146\u2013164, 1975.","journal-title":"Mathematical Programming"},{"key":"136836_CR2","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/0134010","volume":"34","author":"E. Balas","year":"1978","unstructured":"E. Balas and E. Zemel, \"Facets of the knapsack polytope from minimal covers,\" SIAM Journal on Applied Mathematics, vol. 34, pp. 119\u2013148, 1978.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"136836_CR3","unstructured":"R.E. Bixby, E.A. Boyd, S.S. Dadmehr, and R.R. Indovina, \"The MIPLIB mixed integer library,\" Technical Report R92-36, Rice University, 1992."},{"key":"136836_CR4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V. Chv\u00e1tal","year":"1973","unstructured":"V. Chv\u00e1tal, \"Edmonds polytopes and a hierarchy of combinatorial problems,\" Discrete Mathematics, vol. 4, pp. 305\u2013357, 1973.","journal-title":"Discrete Mathematics"},{"key":"136836_CR5","unstructured":"CPLEX Version 3.0, Using the CPLEX Callable Library, CPLEX Optimization, Inc., 1995."},{"key":"136836_CR6","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"H. Crowder, E.L. Johnson, and M. Padberg, \"Solving large-scale zero-one linear programming problems,\" Operations Research, vol. 31, pp. 803\u2013834, 1983.","journal-title":"Operations Research"},{"key":"136836_CR7","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0166-218X(93)90044-O","volume":"42","author":"B.L. Dietrich","year":"1993","unstructured":"B.L. Dietrich, L.F. Escudero, and F. Chance, \"Efficient reformulation for 0-1 programs, methods and computational results,\" Discrete Applied Mathematics, vol. 42, pp. 147\u2013175, 1993.","journal-title":"Discrete Applied Mathematics"},{"key":"136836_CR8","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/0377-2217(94)90250-X","volume":"73","author":"B.L. Dietrich","year":"1994","unstructured":"B.L. Dietrich and L.F. Escudero, \"Obtauning clique, cover and coefficient reduction inequalities as Chv\u00e1tal-Gomory inequalities and Gomory fractional cuts,\" European Journal of Operational Research, vol. 73, pp. 539\u2013546, 1994.","journal-title":"European Journal of Operational Research"},{"key":"136836_CR9","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1287\/opre.13.6.879","volume":"13","author":"F. Glover","year":"1965","unstructured":"F. Glover, \"A multi-phase-dual algorithm for the zero-one integer programming problem,\" Operations Research, vol. 13, pp. 879\u2013919, 1965.","journal-title":"Operations Research"},{"key":"136836_CR10","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/mnsc.13.3.254","volume":"13","author":"F. Glover","year":"1966","unstructured":"F. Glover, \"Generalized cuts in diophantine programming,\" Management Science, vol. 13, pp. 254\u2013268, 1966.","journal-title":"Management Science"},{"key":"136836_CR11","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1287\/opre.16.4.741","volume":"16","author":"F. Glover","year":"1968","unstructured":"F. Glover, \"Surrogate constraunts,\" Operations Research, vol. 16, pp. 741\u2013749, 1968.","journal-title":"Operations Research"},{"key":"136836_CR12","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1287\/opre.23.3.434","volume":"23","author":"F. Glover","year":"1975","unstructured":"F. Glover, \"Surrogate constraunt duality in mathematical programming,\" Operations Research, vol. 23, pp. 434\u2013451, 1975.","journal-title":"Operations Research"},{"key":"136836_CR13","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"R.E. Gomory","year":"1958","unstructured":"R.E. Gomory, \"Outline of an algorithm for integer solutions to linear programs,\" Bulletin of the American Mathematical Society, vol. 64, pp. 275\u2013278, 1958.","journal-title":"Bulletin of the American Mathematical Society"},{"key":"136836_CR14","doi-asserted-by":"crossref","unstructured":"R.E. Gomory, \"Solving linear programming problems in integers,\" in Combinatorial Analysis, R.E. Bellman and M. Hall, Jr. (Eds.), American Mathematical Society, pp. 211\u2013216, 1960.","DOI":"10.1090\/psapm\/010\/0114670"},{"key":"136836_CR15","unstructured":"R.E. Gomory, \"An algorithm for integer solutions to linear programs,\" in Recent Advances in Mathematical Programming, R. Graves and P. Wolfe (Eds.), McGraw-Hill, pp. 269\u2013362."},{"key":"136836_CR16","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1287\/opre.18.5.924","volume":"18","author":"H.J. Greenberg","year":"1970","unstructured":"H.J. Greenberg and W.P. Pierskalla, \"Surrogate mathematical programs,\" Operations Research, vol. 18, pp. 924\u2013939, 1970.","journal-title":"Operations Research"},{"key":"136836_CR17","first-page":"230","volume":"15","author":"H.J. Greenberg","year":"1973","unstructured":"H.J. Greenberg and W.P. Pierskalla, \"Quasi conjugate functions and surrogate duality,\" Cahiers du Centre d\u00c9tudes de Recherche Operationell, vol. 15, pp. 230\u2013334, 1973.","journal-title":"Cahiers du Centre d\u00c9tudes de Recherche Operationell"},{"key":"136836_CR18","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01580442","volume":"8","author":"P.L. Hammer","year":"1975","unstructured":"P.L. Hammer, E.L Johnson, and U.N. Peled, \"Facets of regular 0-1 polytopes,\" Mathematical Programming, vol. 8, pp. 179\u2013206, 1975.","journal-title":"Mathematical Programming"},{"key":"136836_CR19","unstructured":"K. Hoffman, Informal Communication, May 1996."},{"key":"136836_CR20","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1287\/ijoc.3.2.121","volume":"3","author":"K. Hoffman","year":"1991","unstructured":"K. Hoffman and M. Padberg, \"Improving LP-representations of zero-one linear programs for branch-and-cut,\" ORSA Journal on Computing, vol. 3, pp. 121\u2013134, 1991.","journal-title":"ORSA Journal on Computing"},{"key":"136836_CR21","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/BF01588253","volume":"17","author":"M.H. Karwan","year":"1979","unstructured":"M.H. Karwan and R.L. Rardin, \"Some relationships between Lagrangian and surrogate duality in integer programming,\" Mathematical Programming, vol. 17, pp. 320\u2013324, 1979.","journal-title":"Mathematical Programming"},{"key":"136836_CR22","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1287\/opre.33.3.505","volume":"33","author":"R.K. Martin","year":"1985","unstructured":"R.K. Martin and L. Schrage, \"Subset coefficient reduction cuts for 0-1 mixed integer programming,\" Operations Research, vol. 33, pp. 505\u2013526, 1985.","journal-title":"Operations Research"},{"key":"136836_CR23","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, John Wiley & Sons: New York, 1988."},{"key":"136836_CR24","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/BF01588301","volume":"18","author":"M. Padberg","year":"1980","unstructured":"M. Padberg, \"(1; k) configuration and facets for packing problem,\" Mathematical Programming, vol. 18, pp. 94\u201399, 1980.","journal-title":"Mathematical Programming"},{"key":"136836_CR25","unstructured":"M.W.P. Savelsbergh and G.L. Nemhauser, Mixed INTeger Optimizer (MINTO) Version 2.0, 1994."},{"key":"136836_CR26","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"L.A. Wolsey","year":"1975","unstructured":"L.A. Wolsey, \"Faces for a linear inequality in 0-1 variables,\" Mathematical Programming, vol. 8, pp. 165\u2013178, 1975.","journal-title":"Mathematical Programming"},{"key":"136836_CR27","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/BF01609032","volume":"15","author":"E. Zemel","year":"1978","unstructured":"E. Zemel, \"Lifting the facets of zero-one polytopes,\" Mathematical Programming, vol. 15, pp. 268\u2013277, 1978.","journal-title":"Mathematical Programming"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008621204567.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008621204567\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008621204567.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:03:58Z","timestamp":1752375838000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008621204567"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["136836"],"URL":"https:\/\/doi.org\/10.1023\/a:1008621204567","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}