{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T00:24:14Z","timestamp":1779323054985,"version":"3.51.4"},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2000,2]]},"DOI":"10.1016\/s0377-2217(99)00015-6","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"40-55","source":"Crossref","is-referenced-by-count":122,"title":["Conflict graphs in solving integer programming problems"],"prefix":"10.1016","volume":"121","author":[{"given":"Alper","family":"Atamt\u00fcrk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George L.","family":"Nemhauser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin W.P.","family":"Savelsbergh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00015-6_BIB1","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF00127080","article-title":"A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems","volume":"1","author":"Atamt\u00fcrk","year":"1995","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0377-2217(99)00015-6_BIB2","unstructured":"R.E. Bixby, S. Ceria, C.M. McZeal, M.W.P. Savelsbergh, An updated mixed integer programming library: MIPLIB 3.0, Technical Report TR98-03, Department of Computational and Applied Mathematics, Rice University, Houston, TX, 1996. Available from URL http:\/\/www.caam.rice.edu\/\u223cbixby\/miplib\/miplib.html."},{"key":"10.1016\/S0377-2217(99)00015-6_BIB3","unstructured":"R. Bornd\u00f6rfer, R. Weismantel, Set packing relaxations of some integer programs, Technical Report SC 97-30, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, 1997"},{"key":"10.1016\/S0377-2217(99)00015-6_BIB4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.29.1.49","article-title":"Logical reduction methods in zero\u2013one programming","volume":"29","author":"Guignard","year":"1981","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00015-6_BIB5","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1287\/ijoc.3.2.121","article-title":"Improving LP-representations of zero\u2013one linear programs for branch-and-cut","volume":"3","author":"Hoffman","year":"1991","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00015-6_BIB6","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1287\/mnsc.39.6.657","article-title":"Solving airline crew-scheduling problems by branch-and-cut","volume":"39","author":"Hoffman","year":"1993","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00015-6_BIB7","doi-asserted-by":"crossref","unstructured":"D.S. Johnson, M.A. Trick (Eds.), Cliques, Coloring, and Satisfiability, DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, American Mathematical Society, Providence, RI, 1996","DOI":"10.1090\/dimacs\/026"},{"key":"10.1016\/S0377-2217(99)00015-6_BIB8","doi-asserted-by":"crossref","unstructured":"E.L. Johnson, Modeling and strong linear programs for mixed integer programming, in: S.W. Wallace (Ed.), Algorithms and Model Formulations in Mathematical Programming, NATO ASI Series, vol. F51, Springer, Berlin, 1989, pp. 1\u201343","DOI":"10.1007\/978-3-642-83724-1_1"},{"key":"10.1016\/S0377-2217(99)00015-6_BIB9","first-page":"169","article-title":"Degree-two inequalities, clique facets and biperfect graphs","volume":"16","author":"Johnson","year":"1982","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(99)00015-6_BIB10","doi-asserted-by":"crossref","unstructured":"R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller, J.W. Thatcher (Eds.), Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"10.1016\/S0377-2217(99)00015-6_BIB11","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","article-title":"MINTO, a Mixed INTeger Optimizer","volume":"15","author":"Nemhauser","year":"1994","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(99)00015-6_BIB12","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","article-title":"On the facial structure of set packing polyhedra","volume":"5","author":"Padberg","year":"1973","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00015-6_BIB13","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","article-title":"Preprocessing and probing techniques for mixed integer programming problems","volume":"6","author":"Savelsbergh","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00015-6_BIB14","doi-asserted-by":"crossref","first-page":"1070","DOI":"10.1287\/opre.19.4.1070","article-title":"An improved branch-and-bound method for integer programming","volume":"19","author":"Tomlin","year":"1971","journal-title":"Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799000156?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799000156?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T13:22:14Z","timestamp":1556112134000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799000156"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["S0377221799000156"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00015-6","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}