{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T10:54:03Z","timestamp":1693133643876},"reference-count":17,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"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":7412,"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":[[1993,4]]},"DOI":"10.1016\/0166-218x(93)90043-n","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T11:06:34Z","timestamp":1034334394000},"page":"139-145","source":"Crossref","is-referenced-by-count":13,"title":["Note on combinatorial optimization with max-linear objective functions"],"prefix":"10.1016","volume":"42","author":[{"given":"Sung-Jin","family":"Chung","sequence":"first","affiliation":[]},{"given":"Horst W.","family":"Hamacher","sequence":"additional","affiliation":[]},{"given":"Francesco","family":"Maffioli","sequence":"additional","affiliation":[]},{"given":"Katta G.","family":"Murty","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90043-N_BIB1","series-title":"Report 89-1987","article-title":"Approximation of convex functions and application to mathematical programming","author":"Burkard","year":"1987"},{"key":"10.1016\/0166-218X(93)90043-N_BIB2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF01589104","article-title":"Multi-constrained matroidal knapsack problems","volume":"45","author":"Camerini","year":"1989","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(93)90043-N_BIB3","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0167-6377(84)90009-9","article-title":"The matroidal knapsack: A class of (often) well-solvable problems","volume":"3","author":"Camerini","year":"1984","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0166-218X(93)90043-N_BIB4","series-title":"Ph.D. dissertation","article-title":"The complexity of some problems in parametric and linear combinatorial optimization","author":"Carstensen","year":"1983"},{"key":"10.1016\/0166-218X(93)90043-N_BIB5","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/BF02591893","article-title":"Complexity of some parametric integer and network programming problems","volume":"26","author":"Carstensen","year":"1983","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(93)90043-N_BIB6","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1080\/07408178408974693","article-title":"On optimizing bin picking and insertion plans for assembly robots","volume":"16","author":"Drezner","year":"1984","journal-title":"IEEE Trans."},{"key":"10.1016\/0166-218X(93)90043-N_BIB7","series-title":"Practical Methods of Optimization","author":"Fletcher","year":"1987"},{"key":"10.1016\/0166-218X(93)90043-N_BIB8","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(93)90043-N_BIB9","first-page":"41","article-title":"A new exchange property for matroids and its application to max-min problems","volume":"28","author":"Granot","year":"1984","journal-title":"Z. Oper. Res."},{"key":"10.1016\/0166-218X(93)90043-N_BIB10","series-title":"On the min-max solution of some combinatorial problems","author":"Granot","year":"1982"},{"key":"10.1016\/0166-218X(93)90043-N_BIB11","first-page":"21","article-title":"Algorithms for flows with parametric capacities","volume":"33","author":"Hamacher","year":"1989","journal-title":"Z. Oper. Res."},{"key":"10.1016\/0166-218X(93)90043-N_BIB12","series-title":"Introduction to Linear and Nonlinear Programming","author":"Luenberger","year":"1984"},{"key":"10.1016\/0166-218X(93)90043-N_BIB13","series-title":"Linear and Combinatorial Programming","author":"Murty","year":"1976"},{"key":"10.1016\/0166-218X(93)90043-N_BIB14","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02592948","article-title":"Some NP-complete problems in quadratic and nonlinear programming","volume":"39","author":"Murty","year":"1987","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(93)90043-N_BIB15","series-title":"Wiley Interscience Series in Discrete Mathematics and Optimizations","article-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/0166-218X(93)90043-N_BIB16","series-title":"Mathematical Programming: Structures and Algorithms","author":"Shapiro","year":"1979"},{"key":"10.1016\/0166-218X(93)90043-N_BIB17","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/BF01582247","article-title":"Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems","volume":"33","author":"Warburton","year":"1985","journal-title":"Math. Programming"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390043N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390043N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T18:29:16Z","timestamp":1555180156000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9390043N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":17,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["0166218X9390043N"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90043-n","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}