{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:00:09Z","timestamp":1743073209368,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319429014"},{"type":"electronic","value":"9783319429021"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-42902-1_11","type":"book-chapter","created":{"date-parts":[[2017,3,6]],"date-time":"2017-03-06T21:21:19Z","timestamp":1488835279000},"page":"79-85","source":"Crossref","is-referenced-by-count":0,"title":["Computing Partitions with Applications to Capital Budgeting Problems"],"prefix":"10.1007","author":[{"given":"Frank","family":"Gurski","sequence":"first","affiliation":[]},{"given":"Jochen","family":"Rethmann","sequence":"additional","affiliation":[]},{"given":"Eda","family":"Yilmaz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,8]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin (1999)"},{"key":"11_CR2","volume-title":"Optimization Methods in Finance","author":"G Cornuejols","year":"2013","unstructured":"Cornuejols, G., T\u00fct\u00fcnc\u00fc, R.: Optimization Methods in Finance. Cambridge University Press, New York (2013)"},{"key":"11_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"R Downey","year":"2013","unstructured":"Downey, R., Fellows, M.: Fundamentals of Parameterized Complexity. Springer, New York (2013)"},{"key":"11_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco (1979)"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Gurski, F., Rethmann, J., Yilmaz, E.: Capital budgeting problems: A parameterized point of view. In: Operations Research Proceedings (OR 2014), Selected Papers. Springer (2015) (To appear)","DOI":"10.1007\/978-3-319-28697-6_29"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Jansen, K.: A fast approximation scheme for the multiple knapsack problem. In: Proceedings of the Conference on Current Trends in Theory and Practice of Computer Science, vol. 7147, pp. 313\u2013324. Springer, LNCS (2012)","DOI":"10.1007\/978-3-642-27660-6_26"},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Op. Res. 12, 415\u2013440 (1987)","journal-title":"Math. Op. Res."},{"key":"11_CR8","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2010","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2010)"},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1086\/294081","volume":"28","author":"J Lorie","year":"1955","unstructured":"Lorie, J., Savage, L.: Three problems in capital rationing. J. Bus. 28, 229\u2013239 (1955)","journal-title":"J. Bus."},{"issue":"1","key":"11_CR10","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1093\/comjnl\/bxm048","volume":"51","author":"D Marx","year":"2008","unstructured":"Marx, D.: Parameterized complexity and approximation algorithms. Comput. J. 51(1), 60\u201378 (2008)","journal-title":"Comput. J."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Pisinger, D., Toth, P.: Knapsack problems. In: Handbook of Combinatorial Optimization, vol.\u00a0A, pp. 299\u2013428. Kluwer Academic Publishers (1999)","DOI":"10.1007\/978-1-4613-0303-9_5"},{"issue":"7","key":"11_CR12","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1287\/mnsc.12.7.485","volume":"12","author":"H Weingartner","year":"1966","unstructured":"Weingartner, H.: Capital budgeting of interrelated projects: survey and synthesis. Manag. Sci. 12(7), 485\u2013516 (1966)","journal-title":"Manag. Sci."},{"key":"11_CR13","volume-title":"Mathematical Programming and the Analysis of Capital Budgeting Problems","author":"H Weingartner","year":"1963","unstructured":"Weingartner, H., Martin, H.: Mathematical Programming and the Analysis of Capital Budgeting Problems. Prentice Hall Inc, Englewood Cliffs (1963)"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42902-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T06:48:58Z","timestamp":1568875738000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42902-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319429014","9783319429021"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42902-1_11","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2017]]}}}