{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T07:44:49Z","timestamp":1716277489513},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1989,8,1]],"date-time":"1989-08-01T00:00:00Z","timestamp":617932800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1989,8]]},"DOI":"10.1007\/bf01589104","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T12:22:34Z","timestamp":1114690954000},"page":"211-231","source":"Crossref","is-referenced-by-count":13,"title":["Multi-constrained matroidal knapsack problems"],"prefix":"10.1007","volume":"45","author":[{"given":"P. M.","family":"Camerini","sequence":"first","affiliation":[]},{"given":"F.","family":"Maffioli","sequence":"additional","affiliation":[]},{"given":"C.","family":"Vercellis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"Data Structures and Algorithms","author":"A.V. Aho","year":"1983","unstructured":"A.V. Aho, J.E. Hopcroft and J.D. Ullman,Data Structures and Algorithms (Addison-Wesley, Reading, MA, 1983)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1145\/357456.357458","volume":"9","author":"R.D. Armstrong","year":"1983","unstructured":"R.D. Armstrong, D.S. Kung, P. Sinha and A.A. Zoltners, \u201cA computational study of a multiple-choice knapsack algorithm,\u201dACM Transactions on Mathematical Software 9 (1983) 184\u2013198.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01609000","volume":"15","author":"J.F. Balintfy","year":"1978","unstructured":"J.F. Balintfy, G.T. Ross, P. Sinha and A.A. Zoltners, \u201cA mathematical programming system for preference-maximized nonselective menu planning and scheduling,\u201dMathematical Programming 15 (1978) 63\u201376.","journal-title":"Mathematical Programming"},{"key":"CR4","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"D.P. Bertzekas","year":"1982","unstructured":"D.P. Bertzekas,Constrained Optimization and Lagrange Multiplier Methods (Academic Press, Cambridge, 1982)."},{"key":"CR5","volume-title":"\u201cA dynamic planning method for telecommunication networks and its performance evaluation for district trunk networks,\u201dProceedings of 10th International Teletraffic Congress","author":"M. Bonatti","year":"1983","unstructured":"M. Bonatti, P.M. Camerini, L. Fratta, G. Gallassi and F. Maffioli, \u201cA dynamic planning method for telecommunication networks and its performance evaluation for district trunk networks,\u201dProceedings of 10th International Teletraffic Congress (Montereal, Canada, 1983)."},{"key":"CR6","volume-title":"\u201cCapacity assignment in PS networks: a hierarchical planning approach,\u201dProceedings of 11th International Teletraffic Congress","author":"P.M. Camerini","year":"1985","unstructured":"P.M. Camerini and F. Maffioli, \u201cCapacity assignment in PS networks: a hierarchical planning approach,\u201dProceedings of 11th International Teletraffic Congress (Kyoto, Japan, 1985)."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0167-6377(84)90009-9","volume":"3","author":"P.M. Camerini","year":"1984","unstructured":"P.M. Camerini and C. Vercellis, \u201cThe matroidal knapsack: a class of (often) well-solvable problems,\u201dOperations Research Letters 3 (1984) 157\u2013162.","journal-title":"Operations Research Letters"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1287\/moor.8.4.525","volume":"8","author":"M.A.H. Dempster","year":"1983","unstructured":"M.A.H. Dempster, M.L. Fisher, L. Jansen, B.J. Lageweg, J.K. Lenstra and A.H.G. Rinnooy Kan \u201cAnalysis of heuristics for stochastic programming results for hierarchical scheduling problems,\u201dMathematics of Operations Research 8 (1983) 525\u2013537.","journal-title":"Mathematics of Operations Research"},{"key":"CR9","volume-title":"Integer Programming","author":"R.S. Garfinkel","year":"1972","unstructured":"R.S. Garfinkel and G.L. Nemhauser,Integer Programming (Wiley, New York, 1972)."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"A.M. Geoffrion","year":"1974","unstructured":"A.M. Geoffrion, \u201cLagrangean relaxation for integer programming,\u201dMathematical Programming Study 2 (1974) 82\u2013114.","journal-title":"Mathematical Programming Study"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M. Held","year":"1970","unstructured":"M. Held and R.M. Karp, \u201cThe traveling-salesman problem and minimum spanning trees,\u201dOperations Research 18 (1970) 1138\u20131162.","journal-title":"Operations Research"},{"key":"CR12","volume-title":"\u201cAssignment of optimal redundancy in systems subject to failure\u201d, Operations Research Group Technical Report","author":"P. Kolesar","year":"1966","unstructured":"P. Kolesar, \u201cAssignment of optimal redundancy in systems subject to failure\u201d, Operations Research Group Technical Report, Columbia University (New York, 1966)."},{"key":"CR13","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler,Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976)."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1086\/294081","volume":"38","author":"J. Lorie","year":"1955","unstructured":"J. Lorie and L. Savage, \u201cThree problems in capital rationing,\u201dJournal of Business 38 (1955) 229\u2013239.","journal-title":"Journal of Business"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/978-3-642-68874-4_15","volume-title":"Mathematical Programming The State of the Art","author":"R.T. Rockafellar","year":"1983","unstructured":"R.T. Rockafellar, \u201cGeneralized subgradients in mathematical programming,\u201d in: A. Bachem, M. Gr\u00f6tschel and B. Korte, eds.,Mathematical Programming The State of the Art (Springer, Berlin, 1983) pp. 368\u2013390."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1287\/mnsc.26.3.242","volume":"26","author":"P. Sinha","year":"1980","unstructured":"P. Sinha and A.A. Zoltners, \u201cInteger programming models for sales resource allocation,\u201dManagement Science 26 (1980) 242\u2013260.","journal-title":"Management Science"},{"key":"CR17","volume-title":"Problemi di ottimizzazione di strutture ad albero con vincoli di affidabilit\u00e0 e di costo: teoria ed applicazioni","author":"R. Trevisi","year":"1985","unstructured":"R. Trevisi, \u201cProblemi di ottimizzazione di strutture ad albero con vincoli di affidabilit\u00e0 e di costo: teoria ed applicazioni,\u201d Thesis, Department of Information Science, University of Milano (Milan, 1985)."},{"key":"CR18","volume-title":"Matroid Theory","author":"D.J.A. Welsh","year":"1976","unstructured":"D.J.A. Welsh,Matroid Theory (Academic Press, London, 1976)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01589104.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01589104\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01589104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:36:31Z","timestamp":1556897791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01589104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":18,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["BF01589104"],"URL":"https:\/\/doi.org\/10.1007\/bf01589104","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,8]]}}}