{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T10:46:23Z","timestamp":1743331583958},"reference-count":12,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"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":8539,"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":[[1990,3]]},"DOI":"10.1016\/0166-218x(90)90098-w","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"159-173","source":"Crossref","is-referenced-by-count":8,"title":["On an optimization problem with nested constraints"],"prefix":"10.1016","volume":"26","author":[{"given":"M.E.","family":"Dyer","sequence":"first","affiliation":[]},{"given":"A.M.","family":"Frieze","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90098-W_BIB1","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1287\/mnsc.28.1.34","article-title":"The multiple-choice nested knapsack model","volume":"28","author":"Armstrong","year":"1982","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(90)90098-W_BIB2","series-title":"Mathematical Programming: The State of the Art","year":"1983"},{"key":"10.1016\/0166-218X(90)90098-W_BIB3","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","article-title":"Time bounds for selection","volume":"7","author":"Blum","year":"1973","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0166-218X(90)90098-W_BIB4","series-title":"Proceedings of the Eighth Conference on Graph-theoretic Concepts in Computer Science","first-page":"25","article-title":"Network flows in trees and knapsack problems with nested constraints","author":"Brucker","year":"1982"},{"key":"10.1016\/0166-218X(90)90098-W_BIB5","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0166-218X(87)90070-9","article-title":"An algorithm for a separable integer programming problem with cumulatively bounded variables","volume":"16","author":"Dyer","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(90)90098-W_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","article-title":"The Lagrangean relaxation method for solving integer programming problems","volume":"27","author":"Fisher","year":"1981","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(90)90098-W_BIB7","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0022-0000(82)90048-4","article-title":"The complexity of selection and ranking in X + Y and matrices with sorted columns","volume":"24","author":"Frederickson","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(90)90098-W_BIB8","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0771-050X(81)90015-2","article-title":"A separable integer programming problem equivalent to its continual version","volume":"7","author":"Galperin","year":"1981","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/0166-218X(90)90098-W_BIB9","first-page":"114","article-title":"A data structure for dynamic trees","author":"Sleator","year":"1981","journal-title":"Proceedings 13th Annual A.C.M. Symposium on Theory of Computing"},{"key":"10.1016\/0166-218X(90)90098-W_BIB10","series-title":"Further remarks on selection problems with nested constraints","author":"Tamir","year":"1979"},{"key":"10.1016\/0166-218X(90)90098-W_BIB11","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1137\/0318019","article-title":"Efficient algorithms for a selection problem with nested constraints and its application to a production-sales planning model","volume":"18","author":"Tamir","year":"1980","journal-title":"SIAM J. Control Optim."},{"key":"10.1016\/0166-218X(90)90098-W_BIB12","series-title":"CBMS-NSF Regional Conference Series in Applied Mathematics","article-title":"Data structures and network algorithms","author":"Tarjan","year":"1983"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090098W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090098W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:56:44Z","timestamp":1555120604000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090098W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":12,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["0166218X9090098W"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90098-w","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}