{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T08:44:34Z","timestamp":1751877874993},"reference-count":16,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6255,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1996,6]]},"DOI":"10.1016\/0166-218x(95)00060-5","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"153-167","source":"Crossref","is-referenced-by-count":29,"title":["Tighter representations for set partitioning problems"],"prefix":"10.1016","volume":"68","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youngho","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(95)00060-5_BIB1","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","article-title":"A tight linearization and an algorithm for zero-one quadratic programs","volume":"32","author":"Adams","year":"1986","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(95)00060-5_BIB2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01581249","article-title":"Mixed-integer bilinear programming problems","volume":"59","author":"Adams","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(95)00060-5_BIB3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0167-5060(08)70725-8","article-title":"Some valid inequalities for the set partitioning problem","volume":"1","author":"Balas","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0166-218X(95)00060-5_BIB4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","article-title":"A lift-and-project cutting plane procedure for mixed 0 1 programming","volume":"58","author":"Balas","year":"1993","journal-title":"Math. Progamming"},{"key":"10.1016\/0166-218X(95)00060-5_BIB5","series-title":"An algorithm for set partitioning","first-page":"74","article-title":"On the set covering problem: II","volume":"23","author":"Balas","year":"1975"},{"key":"10.1016\/0166-218X(95)00060-5_BIB6","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1137\/1018115","article-title":"Set partitioning: a survey","volume":"18","author":"Balas","year":"1976","journal-title":"SIAM Rev."},{"key":"10.1016\/0166-218X(95)00060-5_BIB7","article-title":"Lift-and-project methods for mixed 0\u20131 programs","author":"Ceria","year":"1993"},{"key":"10.1016\/0166-218X(95)00060-5_BIB8","first-page":"S40","volume":"40","author":"Chan","year":"1992","journal-title":"A multiplier adjustment approach for the set partitioning problem. Oper Res."},{"key":"10.1016\/0166-218X(95)00060-5_BIB9","first-page":"674","volume":"36","author":"Fisher","year":"1990","journal-title":"Optimal solution of set covering\/partitioning problems using dual heuristics. Management Sci."},{"key":"10.1016\/0166-218X(95)00060-5_BIB10","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1287\/opre.17.5.848","article-title":"The set partitioning problem: set covering with equality constraints","volume":"17","author":"Garfinkel","year":"1969","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(95)00060-5_BIB11","series-title":"ORSA\/TIMS Joint National Meeting","article-title":"Solving large set-partitioning problems with side constraints","author":"Hoffman","year":"1992"},{"key":"10.1016\/0166-218X(95)00060-5_BIB12","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1287\/mnsc.20.5.774","article-title":"An algorithm for large set partitioning problems","volume":"20","author":"Marsten","year":"1974","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(95)00060-5_BIB13","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1002\/nav.3800260401","article-title":"Optimal set partitioning matchings and Lagrangian duality","volume":"26","author":"Nemhauser","year":"1979","journal-title":"Naval Res. Logis. Quart."},{"key":"10.1016\/0166-218X(95)00060-5_BIB14","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/0166-218X(95)00060-5_BIB15","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","article-title":"A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems","volume":"3","author":"Sherali","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0166-218X(95)00060-5_BIB16","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","article-title":"A hierarchy of relaxations and convex hull characterizations for mixed integer zero-one programming problems","volume":"52","author":"Sherali","year":"1994","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X95000605?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X95000605?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T19:54:31Z","timestamp":1556394871000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X95000605"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["0166218X95000605"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(95)00060-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}