{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T20:14:30Z","timestamp":1776284070256,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0167-6377(01)00100-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:28:48Z","timestamp":1027592928000},"page":"107-114","source":"Crossref","is-referenced-by-count":54,"title":["Flow pack facets of the single node fixed-charge flow polytope"],"prefix":"10.1016","volume":"29","author":[{"given":"Alper","family":"Atamt\u00fcrk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(01)00100-6_BIB1","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1287\/moor.20.3.562","article-title":"Capacitated facility location: valid inequalities and facets","volume":"20","author":"Aardal","year":"1995","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(01)00100-6_BIB2","unstructured":"A. Atamt\u00fcrk, Flow pack facets of the single node fixed-charge flow polytope, Research Report BCOL99.01, University of California at Berkeley, Berkeley, USA, 1999, available at http:\/\/ieor.berkeley.edu\/\u223catamturk."},{"key":"10.1016\/S0167-6377(01)00100-6_BIB3","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BFb0121006","article-title":"Uncapacitated lot sizing: the convex hull of solutions","volume":"22","author":"Barany","year":"1984","journal-title":"Math. Programming Stud."},{"key":"10.1016\/S0167-6377(01)00100-6_BIB4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s101070050092","article-title":"bc-opt: a branch-and-cut code for mixed integer programs","volume":"86","author":"Cordier","year":"1999","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(01)00100-6_BIB5","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/s101070050067","article-title":"Lifted flow cover inequalities for mixed 0\u20131 integer programs","volume":"85","author":"Gu","year":"1999","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(01)00100-6_BIB6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1009841107478","article-title":"Sequence independent lifting in mixed integer programming","volume":"4","author":"Gu","year":"2000","journal-title":"J. Combin. Optim."},{"key":"10.1016\/S0167-6377(01)00100-6_BIB7","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s101070050044","article-title":"The 0\u20131 knapsack problem with a single continuous variable","volume":"85","author":"Marchand","year":"1999","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(01)00100-6_BIB8","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":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(01)00100-6_BIB9","first-page":"842","article-title":"Valid linear inequalities for fixed charge problems","volume":"32","author":"Padberg","year":"1984","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(01)00100-6_BIB10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0167-6377(88)90076-4","article-title":"Valid inequalities and separation for capacitated economic lot sizing","volume":"7","author":"Pochet","year":"1988","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(01)00100-6_BIB11","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0166-218X(97)89210-4","article-title":"The complementary class of generalized flow cover inequalities","volume":"77","author":"Stallaert","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-6377(01)00100-6_BIB12","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0166-218X(86)90061-2","article-title":"Valid inequalities for mixed 0\u20131 programs","volume":"14","author":"Van Roy","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-6377(01)00100-6_BIB13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.35.1.45","article-title":"Solving mixed integer programming problems using automatic reformulation","volume":"35","author":"Van Roy","year":"1987","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(01)00100-6_BIB14","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1287\/moor.2.1.66","article-title":"Valid inequalities and superadditivity for 0\/1 integer programs","volume":"2","author":"Wolsey","year":"1977","journal-title":"Math. Oper. Res."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701001006?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701001006?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T03:53:42Z","timestamp":1556423622000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637701001006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0167637701001006"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(01)00100-6","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}