{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:23Z","timestamp":1725559163884},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540261995"},{"type":"electronic","value":"9783540321026"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496915_21","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T16:40:39Z","timestamp":1279125639000},"page":"276-290","source":"Crossref","is-referenced-by-count":5,"title":["Smoothed Analysis of Integer Programming"],"prefix":"10.1007","author":[{"given":"Heiko","family":"R\u00f6glin","sequence":"first","affiliation":[]},{"given":"Berthold","family":"V\u00f6cking","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Banderier, C., Beier, R., Mehlhorn, K.: Smoothed Analysis of Three Combinatorial Problems. In: Proc. 28th International Symposium on Mathematical Foundations of Computer Science (MFCS-2003), vol.\u00a097, pp. 198\u2013207 (2003)","DOI":"10.1007\/978-3-540-45138-9_14"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Beier, R., V\u00f6cking, B.: An Experimental Study of Random Knapsack Problems. In: Proc. of the 12th Annual European Symposium on Algorithms (ESA-2004), pp. 616\u2013627 (2004)","DOI":"10.1007\/978-3-540-30140-0_55"},{"key":"21_CR3","unstructured":"Beier, R., V\u00f6cking, B.: Probabilistic Analysis of Knapsack Core Algorithms. In: Proc. of the 15th Annual Symposium on Discrete Algorithms (SODA-2004), New Orleans, USA, pp. 468\u2013477 (2004)"},{"issue":"3","key":"21_CR4","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.jcss.2004.04.004","volume":"69","author":"R. Beier","year":"2004","unstructured":"Beier, R., V\u00f6cking, B.: Random Knapsack in Expected Polynomial Time. Journal of Computer and System Sciences\u00a069(3), 306\u2013329 (2004)","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Beier, R., V\u00f6cking, B.: Typical Properties of Winners and Losers in Discrete Optimization. In: Proc. of the 36th Annual ACM Symposium on Theory of Computing (STOC-2004), pp. 343\u2013352 (2004)","DOI":"10.1145\/1007352.1007409"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jcom.1994.1005","volume":"10","author":"K.H. Borgwardt","year":"1994","unstructured":"Borgwardt, K.H., Brzank, J.: Average Saving Effects in Enumerative Methods for Solving Knapsack Problems. Journal of Complexity\u00a010, 129\u2013141 (1994)","journal-title":"Journal of Complexity"},{"key":"21_CR7","unstructured":"Crescenzi, P., Kann, V., Halldorsson, M., Karpinski, M., Woeginger, G.: A compendium of NP optimization problems, http:\/\/www.nada.kth.se\/~viggo\/problemlist\/compendium.html"},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1287\/moor.14.1.162","volume":"14","author":"M.E. Dyer","year":"1989","unstructured":"Dyer, M.E., Frieze, A.M.: Probabilistic Analysis of the Multidimensional Knapsack Problem. Mathematics of Operations Research\u00a014(1), 162\u2013176 (1989)","journal-title":"Mathematics of Operations Research"},{"key":"21_CR9","volume-title":"Computers and Intractability","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability. Freeman, New York (1979)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Goldberg, A., Marchetti-Spaccamela, A.: On Finding the Exact Solution to a Zero-One Knapsack Problem. In: Proc. of the 16th Annual ACM Symposium on Theory of Computing (STOC-1984), pp. 359\u2013368 (1984)","DOI":"10.1145\/800057.808701"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1006\/jagm.1998.0954","volume":"19","author":"G.S. Lueker","year":"1998","unstructured":"Lueker, G.S.: Average-Case Analysis of Off-Line and On-Line Knapsack Problems. Journal of Algorithms\u00a019, 277\u2013305 (1998)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"21_CR12","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/990308.990310","volume":"51","author":"D.A. Spielman","year":"2004","unstructured":"Spielman, D.A., Teng, S.-H.: Smoothed Analysis of Algorithms: Why The Simplex Algorithm Usually Takes Polynomial Time. Journal of the ACM\u00a051(3), 385\u2013463 (2004)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496915_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:00:30Z","timestamp":1605643230000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496915_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261995","9783540321026"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11496915_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}