{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:11:33Z","timestamp":1774415493218,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ZOR - Methods and Models of Operations Research"],"published-print":{"date-parts":[[1991,3]]},"DOI":"10.1007\/bf02331572","type":"journal-article","created":{"date-parts":[[2006,3,14]],"date-time":"2006-03-14T21:55:53Z","timestamp":1142373353000},"page":"113-149","source":"Crossref","is-referenced-by-count":3,"title":["The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem"],"prefix":"10.1007","volume":"35","author":[{"given":"K. H.","family":"Borgwardt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Tremel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02331572_CR1","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF00046618","volume":"10","author":"K H Borgwardt","year":"1987","unstructured":"Borgwardt K H (1987) \u201cProbabilistic analysis of optimization algorithms \u2014 Some aspects from a practical point of view\u201d, Acta Applicandae Mathematicae 10 (1987): 171\u2013210.","journal-title":"Acta Applicandae Mathematicae"},{"key":"BF02331572_CR2","unstructured":"Coffman E G, Jr., Fayolle G, Jacquet P & Robert P (1989) \u201cLargest-first sequential selection with a sum constraint\u201d, Report of AT & T Bell Laboratories, Murray Hill, New Jersey, 1989."},{"key":"BF02331572_CR3","volume-title":"Report 8602\/A, Econometric Institute","author":"E G Coffman Jr.","year":"1986","unstructured":"Coffman E G, Jr., Lueker G S & Rinnooy Kan A H G (1986) \u201cAn introduction to the probabilistic analysis of sequencing and packing heuristics\u201d, Report 8602\/A, Econometric Institute, Erasmus Universiteit Rotterdam, Rotterdam."},{"key":"BF02331572_CR4","first-page":"279","volume":"40","author":"G D'Atri","year":"1980","unstructured":"D'Atri G & Di Rende A (1980) \u201cProbabilistic analysis of knapsack-type problems\u201d, Methods of Operations Research 40 (1980): 279\u2013282.","journal-title":"Methods of Operations Research"},{"key":"BF02331572_CR5","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0166-218X(82)90055-5","volume":"4","author":"G D'Atri","year":"1982","unstructured":"D'Atri G & Puech C (1982) \u201cProbabilistic analysis of the subset-sum problem\u201d, Discrete Applied Mathematics 4 (1982): 329\u2013334.","journal-title":"Discrete Applied Mathematics"},{"key":"BF02331572_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M R Garey","year":"1979","unstructured":"Garey M R & Johnson D S (1979) \u201cComputers and Intractability: A Guide to the Theory of NP-Completeness\u201d, Freeman, San Francisco, 1979."},{"key":"BF02331572_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel M, Lov\u00e1sz L & Schrijver A (1988): Geometric Algorithms and Combinatorial Optimization, Springer, Heidelberg, 1988."},{"key":"BF02331572_CR8","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O H Ibarra","year":"1975","unstructured":"Ibarra O H & Kim C E (1975) \u201cFast approximation algorithms for the knapsack and sum of subset problems\u201d, Journal of the Association for Computing Machinery 22 (1975): 463\u2013468.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"BF02331572_CR9","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D S Johnson","year":"1984","unstructured":"Johnson D S (1984) \u201cApproximation algorithms for combinatorial problems\u201d, Journal of Computer and System Sciences 9 (1984): 256\u2013278.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF02331572_CR10","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1145\/2455.2461","volume":"32","author":"J C Lagarias","year":"1985","unstructured":"Lagarias J C & Odlyzko A M (1985) \u201cSolving low-density subset-sum problems\u201d, Journal of the Association for Computing Machinery 32 (1985): 229\u2013246.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"BF02331572_CR11","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.4.4.339","volume":"4","author":"E L Lawler","year":"1979","unstructured":"Lawler E L (1979) \u201cFast approximation algorithms for knapsack problems\u201d, Mathematics of Operations Research 4 (1979): 339\u2013356.","journal-title":"Mathematics of Operations Research"},{"key":"BF02331572_CR12","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0377-2217(77)90024-8","volume":"1","author":"S Martello","year":"1977","unstructured":"Martello S & Toth P (1977) \u201cAn upper bound for the zero-one knapsack problem and a branch and bound algorithm\u201d, European Journal of Operations Research 1 (1977): 169\u2013175.","journal-title":"European Journal of Operations Research"},{"key":"BF02331572_CR13","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/BF02612360","volume":"28","author":"S Martello","year":"1984","unstructured":"Martello S & Toth P (1984) \u201cWorst-case analysis of greedy algorithms for the subset-sum problem\u201d, Mathematical Programming 28 (1984): 198\u2013205.","journal-title":"Mathematical Programming"},{"key":"BF02331572_CR14","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/0377-2217(85)90115-8","volume":"22","author":"S Martello","year":"1985","unstructured":"Martello S & Toth P (1985) \u201cApproximation schemes for the subset-sum problem: Survey and experimental analysis\u201d, European Journal of Operations Research 22 (1985): 56\u201369.","journal-title":"European Journal of Operations Research"},{"key":"BF02331572_CR15","first-page":"147","volume":"12","author":"K Szkatula","year":"1983","unstructured":"Szkatula K & Libura M (1983) \u201cProbabilistic analysis of simplex algorithms for binary knapsack problems\u201d, Control and Cybernetics 12 (1983): 147\u2013158.","journal-title":"Control and Cybernetics"},{"key":"BF02331572_CR16","volume-title":"Report 126","author":"K Szkatula","year":"1986","unstructured":"Szkatula K & Libura M (1986) \u201cProbabilistic properties of threshold and greedy algorithms for the binary knapsack problem\u201d, Report 126, Polska Akacemia Nauk, Instytut Badan Systemowych, Warszawa."},{"key":"BF02331572_CR17","volume-title":"Report 154","author":"K Szkatula","year":"1987","unstructured":"Szkatula K & Libura M (1987) \u201cOn probabilistic properties of greedy-like algorithms for the binary knapsack problem\u201d, Report 154, Polska Akacemia Nauk, Instytut Badan Systemowych, Warszawa."},{"key":"BF02331572_CR18","unstructured":"Tinhofer G (1984) \u201cProbabilistische Ans\u00e4tze in der diskreten Optimierung\u201d, Berichte der Mathematisch-Statistischen Sektion in der Forschungsgesellschaft Joanneum, Bericht Nr. 230, 1984."},{"key":"BF02331572_CR19","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0020-0190(86)90123-7","volume":"23","author":"G Tinhofer","year":"1986","unstructured":"Tinhofer G & Schreck H (1986) \u201cThe bounded Subset Sum Problem is almost everywhere randomly decidable in O(n)\u201d, Information Processing Letters 23 (1986): 11\u201317.","journal-title":"Information Processing Letters"}],"container-title":["ZOR - Methods and Models of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02331572.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02331572\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02331572","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T19:14:49Z","timestamp":1683400489000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02331572"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["BF02331572"],"URL":"https:\/\/doi.org\/10.1007\/bf02331572","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}