{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:07:17Z","timestamp":1761620837287},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1016\/0305-0548(94)90089-2","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"265-279","source":"Crossref","is-referenced-by-count":44,"title":["Logic cuts for processing networks with fixed charges"],"prefix":"10.1016","volume":"21","author":[{"given":"J.N.","family":"Hooker","sequence":"first","affiliation":[]},{"given":"H.","family":"Yan","sequence":"additional","affiliation":[]},{"given":"I.E.","family":"Grossmann","sequence":"additional","affiliation":[]},{"given":"R.","family":"Raman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90089-2_BIB1","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1002\/aic.690310908","article-title":"An milp formulation for heat-integrated distillation Sequences","volume":"31","author":"Andrecovich","year":"1985","journal-title":"AICHE J."},{"key":"10.1016\/0305-0548(94)90089-2_BIB2","article-title":"A cutting plane algorithm for mixed 0\u20131 programs","author":"Balas","year":"1991"},{"key":"10.1016\/0305-0548(94)90089-2_BIB3","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","article-title":"Edmonds polytopes and a hierarchy of combinatorial problems","volume":"4","author":"Chv\u00e1tal","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/0305-0548(94)90089-2_BIB4","first-page":"121","article-title":"Optimal subtrees and extensions","volume":"16","author":"Gr\u00f6flin","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0305-0548(94)90089-2_BIB5","article-title":"A computational study of satisfiability algorithms for prepositional logic","author":"Harche","year":"1991"},{"key":"10.1016\/0305-0548(94)90089-2_BIB6","article-title":"Generalized resolution for 0\u20131 linear inequalities","author":"Hooker","year":"1993","journal-title":"Ann. Math. AI."},{"key":"10.1016\/0305-0548(94)90089-2_BIB7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(87)90026-6","article-title":"Representability in mixed integer programming: characterization results","volume":"17","author":"Jeroslow","year":"1987","journal-title":"Discrete appl. Math."},{"key":"10.1016\/0305-0548(94)90089-2_BIB8","article-title":"Logic based decision support-mixed integer model formulation","author":"Jeroslow","year":"1989"},{"key":"10.1016\/0305-0548(94)90089-2_BIB9","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF01531077","article-title":"Solving prepositional satisfiability problems","volume":"1","author":"Jeroslow","year":"1990","journal-title":"Ann. Math. Artif. Intell."},{"key":"10.1016\/0305-0548(94)90089-2_BIB10","series-title":"International Symposium on Process Systems Engineering","article-title":"Logical inference in branch and bound search for process synthesis","author":"Raman","year":"1991"},{"key":"10.1016\/0305-0548(94)90089-2_BIB11","doi-asserted-by":"crossref","first-page":"1049","DOI":"10.1016\/0098-1354(89)87046-2","article-title":"Optimization model for long range planning in the chemical industry","volume":"13","author":"Sahinidis","year":"1989","journal-title":"Comput. Chem. Eng."},{"key":"10.1016\/0305-0548(94)90089-2_BIB12","article-title":"Hierarchy of relaxations and convex hull characterizations for mixed-integer zero one programming problems","author":"Sherali","year":"1989"},{"key":"10.1016\/0305-0548(94)90089-2_BIB13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.35.1.45","article-title":"Solving mixed integer programs by automatic reformulation","volume":"35","author":"Van Roy","year":"1987","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(94)90089-2_BIB14","series-title":"Model Building in Mathematical Programming","author":"Williams","year":"1988"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900892?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900892?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T17:26:20Z","timestamp":1552929980000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894900892"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0305054894900892"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90089-2","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}