{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T03:47:36Z","timestamp":1777520856073,"version":"3.51.4"},"reference-count":25,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/100016848","name":"National Chengchi University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100016848","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1016\/0305-0548(95)00028-3","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"237-253","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":24,"title":["Long range planning in the process industries: A projection approach"],"prefix":"10.1016","volume":"23","author":[{"given":"Ming-Long","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolaos V.","family":"Sahinidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(95)00028-3_BIB1","doi-asserted-by":"crossref","first-page":"1080","DOI":"10.1287\/mnsc.23.10.1080","article-title":"Simultaneous investment and allocation decisions applied to water planning","volume":"23","author":"Armstrong","year":"1977","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(95)00028-3_BIB2","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1002\/net.3230130405","article-title":"The perfectly matchable subgraph polytope of a bipartite graph","volume":"13","author":"Balas","year":"1983","journal-title":"Networks"},{"key":"10.1016\/0305-0548(95)00028-3_BIB3","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","article-title":"Partitioning procedures for solving mixed-variables programming problems","volume":"4","author":"Benders","year":"1962","journal-title":"Num. Math."},{"key":"10.1016\/0305-0548(95)00028-3_BIB4","author":"Brooke","year":"1988"},{"key":"10.1016\/0305-0548(95)00028-3_BIB5","series-title":"Using the CPLEX Callable Library and CPLEX Mixed Integer Library","author":"CPLEX Optimization, Inc.","year":"1993"},{"key":"10.1016\/0305-0548(95)00028-3_BIB6","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","article-title":"Solving large-scale zero-one linear programming problems","volume":"31","author":"Crowder","year":"1983","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(95)00028-3_BIB7","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1287\/opre.35.6.832","article-title":"Solving multi-item capacitated lot-sizing problems using variable redefinition","volume":"35","author":"Eppen","year":"1987","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(95)00028-3_BIB8","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1287\/mnsc.26.7.669","article-title":"Deterministic production planning: algorithms and complexity","volume":"26","author":"Florian","year":"1980","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(95)00028-3_BIB9","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/BF00934810","article-title":"Generalized benders decomposition","volume":"10","author":"Geoffrion","year":"1972","journal-title":"JOTA"},{"key":"10.1016\/0305-0548(95)00028-3_BIB10","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences theorems in combinatorial optimization","volume":"1","author":"Gr\u00f6tschel","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/0305-0548(95)00028-3_BIB11","series-title":"Logical Inference and Polyhedral Projection","author":"Hooker","year":"1992"},{"key":"10.1016\/0305-0548(95)00028-3_BIB12","series-title":"Investments for Capacity Expansion","year":"1967"},{"key":"10.1016\/0305-0548(95)00028-3_BIB13","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1287\/opre.35.6.820","article-title":"Generating alternative mixed-integer programming models using variable redefinition","volume":"35","author":"Martin","year":"1987","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(95)00028-3_BIB14","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0167-6377(91)90028-N","article-title":"Using separation algorithms to generate mixed integer model reformulations","volume":"10","author":"Martin","year":"1991","journal-title":"Opns Res. Lett."},{"key":"10.1016\/0305-0548(95)00028-3_BIB15","first-page":"283","article-title":"Network synthesis and dynamic network optimization","volume":"31","author":"Minoux","year":"1987","journal-title":"Annls Discrete Math."},{"key":"10.1016\/0305-0548(95)00028-3_BIB16","series-title":"Projections and reformations of the network loading problem","author":"Mirchandani","year":"1990"},{"key":"10.1016\/0305-0548(95)00028-3_BIB17","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1287\/mnsc.23.9.946","article-title":"Planning electric power generation: a nonlinear mixed integer model employing benders decomposition","volume":"23","author":"Noonan","year":"1977","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(95)00028-3_BIB18","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1021\/ie00025a010","article-title":"Strategic planning model for complete process flexibility","volume":"33","author":"Norton","year":"1994","journal-title":"Ind. Engng. Chem. Res."},{"key":"10.1016\/0305-0548(95)00028-3_BIB19","article-title":"Tighter relaxations of fixed charge network flow problems","author":"Rardin","year":"1979","journal-title":"Georgia Institute of Tech, Industrial & Systems Engineering Report #J-79-18"},{"key":"10.1016\/0305-0548(95)00028-3_BIB20","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0377-2217(93)90263-M","article-title":"Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems","volume":"71","author":"Rardin","year":"1993","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/0305-0548(95)00028-3_BIB21","doi-asserted-by":"crossref","first-page":"1049","DOI":"10.1016\/0098-1354(89)87046-2","article-title":"Long range planning model for the chemical process industries","volume":"13","author":"Sahinidis","year":"1989","journal-title":"Computers Chem. Engng"},{"key":"10.1016\/0305-0548(95)00028-3_BIB22","doi-asserted-by":"crossref","first-page":"S127","DOI":"10.1287\/opre.40.1.S127","article-title":"Reformulation of the multi-period MILP model for capacity expansion of chemical processes","volume":"40","author":"Sahinidis","year":"1992","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(95)00028-3_BIB23","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(95)00028-3_BIB24","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1002\/net.3230190510","article-title":"The path set polytope of an acyclic, directed group with an application to machine sequencing","volume":"19","author":"Vande Vate","year":"1989","journal-title":"Networks"},{"key":"10.1016\/0305-0548(95)00028-3_BIB25","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01589102","article-title":"Strong formulations for mixed integer programming: a survey","volume":"45","author":"Wolsey","year":"1989","journal-title":"Math. Progr."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054895000283?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054895000283?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T14:31:56Z","timestamp":1762266716000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054895000283"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0305054895000283"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(95)00028-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Long range planning in the process industries: A projection approach","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0305-0548(95)00028-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}