{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T12:49:56Z","timestamp":1648990196676},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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":5951,"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":[[1997,4]]},"DOI":"10.1016\/s0166-218x(96)00015-7","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"57-68","source":"Crossref","is-referenced-by-count":5,"title":["The cardinality and precedence constrained maximum value sub-hypergraph problem and its applications"],"prefix":"10.1016","volume":"74","author":[{"given":"David","family":"Nehme","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Gang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00015-7_BIB1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0166-218X(90)90053-F","article-title":"Polyhedral results for the precedence-constrained knapsack problem","volume":"41","author":"Boyd","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(96)00015-7_BIB2","first-page":"124","article-title":"Exact algorithms for the setup knapsack problem","volume":"32","author":"Cackles","year":"1994","journal-title":"INFOR"},{"issue":"4","key":"10.1016\/S0166-218X(96)00015-7_BIB3","doi-asserted-by":"crossref","first-page":"1268","DOI":"10.1287\/opre.42.4.688","article-title":"Computational complexity of some maximum average weight problems with precedence constraints","volume":"42","author":"Faigle","year":"1994","journal-title":"Oper. Res."},{"issue":"6","key":"10.1016\/S0166-218X(96)00015-7_BIB4","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1002\/1520-6750(199410)41:6<833::AID-NAV3220410611>3.0.CO;2-Q","article-title":"On the set union knapsack problem","volume":"41","author":"Goldschmidt","year":"1994","journal-title":"Naval Res. Logist."},{"issue":"3","key":"10.1016\/S0166-218X(96)00015-7_BIB5","first-page":"205","article-title":"Optimal tool module design problem for NC machine tools","volume":"27","author":"Hirabayashi","year":"1984","journal-title":"J. Oper. Res. Soc. Japan"},{"issue":"1","key":"10.1016\/S0166-218X(96)00015-7_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.8.1.1","article-title":"On knapsacks, partitions, and a new dynamic programming technique for trees","volume":"8","author":"Johnson","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(96)00015-7_BIB7","series-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"issue":"4","key":"10.1016\/S0166-218X(96)00015-7_BIB8","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1145\/1994.2209","article-title":"Vertical partitioning algorithms for database design","volume":"9","author":"Navathe","year":"1984","journal-title":"ACM Trans. Database Systems"},{"issue":"3","key":"10.1016\/S0166-218X(96)00015-7_BIB9","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1287\/mnsc.17.3.200","article-title":"A selection problem of shared fixed costs and network flows","volume":"17","author":"Rhys","year":"1970","journal-title":"Management Sci."},{"issue":"5","key":"10.1016\/S0166-218X(96)00015-7_BIB10","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1287\/opre.36.5.778","article-title":"Models arising from a flexible manufacturing machine, part II: minimizing the number of switching instants","volume":"36","author":"Tang","year":"1988","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(96)00015-7_BIB11","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579369","article-title":"A strongly polynomial minimum cost circulation algorithm","volume":"5","author":"Tardos","year":"1985","journal-title":"Combinatorica"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000157?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000157?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:28:33Z","timestamp":1556130513000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96000157"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["S0166218X96000157"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00015-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}