{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:35:39Z","timestamp":1774946139415,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2009,8,8]],"date-time":"2009-08-08T00:00:00Z","timestamp":1249689600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s10107-009-0298-1","type":"journal-article","created":{"date-parts":[[2009,8,7]],"date-time":"2009-08-07T12:36:55Z","timestamp":1249648615000},"page":"149-169","source":"Crossref","is-referenced-by-count":61,"title":["Maximizing a class of submodular utility functions"],"prefix":"10.1007","volume":"128","author":[{"given":"Shabbir","family":"Ahmed","sequence":"first","affiliation":[]},{"given":"Alper","family":"Atamt\u00fcrk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,8,8]]},"reference":[{"key":"298_CR1","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1016\/j.ejor.2005.10.075","volume":"181","author":"R. Aboolian","year":"2007","unstructured":"Aboolian R., Berman O., Krass D.: Competitive facility location model with concave demand. Eur. J. Oper. Res. 181, 598\u2013619 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"298_CR2","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1287\/opre.1030.0099","volume":"52","author":"A. Atamt\u00fcrk","year":"2004","unstructured":"Atamt\u00fcrk A.: Sequence independent lifting for mixed-integer programming. Oper. Res. 52, 487\u2013490 (2004)","journal-title":"Oper. Res."},{"key":"298_CR3","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E. Balas","year":"1975","unstructured":"Balas E.: Facets of the knapsack polytope. Math. Program. 8, 146\u2013164 (1975)","journal-title":"Math. Program."},{"key":"298_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0966-8349(98)00047-3","volume":"6","author":"O. Berman","year":"1998","unstructured":"Berman O., Krass D.: Flow intercepting spatial interaction model: a new approach to optimal location of competitive facilities. Locat. Sci. 6, 41\u201365 (1998)","journal-title":"Locat. Sci."},{"key":"298_CR5","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1057\/jors.1995.45","volume":"46","author":"J.L. Corner","year":"1995","unstructured":"Corner J.L., Corner P.D.: Characteristics of decisions in decision analysis practice. J. Oper. Res. Soc. 46, 304\u2013314 (1995)","journal-title":"J. Oper. Res. Soc."},{"key":"298_CR6","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Nisan, N., Schapira, M.: Approximation algorithms for combinatorial auctions with complement-free bidders. In: STOC 2005 Proceedings of the 37th annual ACM symposium on theory of computing, pp. 610\u2013618. ACM (2005)","DOI":"10.1145\/1060590.1060681"},{"key":"298_CR7","doi-asserted-by":"crossref","unstructured":"Feige, U.: On maximizing welfare when utility functions are subadditive. In: STOC 2006 Proceedings of the thirty-eighth annual ACM symposium on theory of computing, pp. 41\u201350. ACM (2006)","DOI":"10.1145\/1132516.1132523"},{"key":"298_CR8","doi-asserted-by":"crossref","unstructured":"Feige, U., Mirrokni V.S., Vondr\u00e1k J.: Maximizing non-monotone submodular functions. In: FOCS 2007 Proceedings of the 48th annual IEEE symposium on foundations of computer science, pp. 461\u2013471. IEEE (2007)","DOI":"10.1109\/FOCS.2007.29"},{"key":"298_CR9","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.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"key":"298_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/A:1009841107478","volume":"4","author":"Z. Gu","year":"2000","unstructured":"Gu Z., Nemhauser G.L., Savelsbergh M.W.P.: Sequence independent lifting in mixed integer programming. J. Comb. Optim. 4, 109\u2013129 (2000)","journal-title":"J. Comb. Optim."},{"key":"298_CR11","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF01580442","volume":"8","author":"P.L. Hammer","year":"1975","unstructured":"Hammer P.L., Johnson E.L., Peled U.N.: Facets of regular 0-1 polytopes. Math. Program. 8, 179\u2013206 (1975)","journal-title":"Math. Program."},{"key":"298_CR12","volume-title":"Functional Analysis and Semi-Groups","author":"E. Hille","year":"1957","unstructured":"Hille E., Phillips R.S.: Functional Analysis and Semi-Groups. American Mathematical Society, Providence (1957)"},{"key":"298_CR13","doi-asserted-by":"publisher","first-page":"34","DOI":"10.2307\/1249154","volume":"28","author":"D.L. Huff","year":"1964","unstructured":"Huff D.L.: Defining and estimating a trade area. J. Mark. 28, 34\u201338 (1964)","journal-title":"J. Mark."},{"key":"298_CR14","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0167-6377(90)90067-F","volume":"9","author":"T.D. Klastorin","year":"1990","unstructured":"Klastorin T.D.: On a discrete nonlinear and nonseparable knapsack problem. Oper. Res. Lett. 9, 233\u2013237 (1990)","journal-title":"Oper. Res. Lett."},{"key":"298_CR15","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/0377-2217(95)00205-7","volume":"94","author":"H. Lee","year":"1996","unstructured":"Lee H., Nemhauser G.L., Wang Y.: Maximizing a submodular function by integer programming: polyhedral results for the quadratic case. Eur. J. Oper. Res. 94, 154\u2013166 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"298_CR16","doi-asserted-by":"crossref","unstructured":"Lehmann, B. Lehmann, D., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. In: EC \u201901 Proceedings of the 3rd ACM conference on electronic Commerce, pp. 18\u201328. ACM (2001)","DOI":"10.1145\/501158.501161"},{"key":"298_CR17","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.geb.2005.02.006","volume":"55","author":"B. Lehmann","year":"2006","unstructured":"Lehmann B., Lehmann D., Nisan N.: Combinatorial auctions with decreasing marginal utilities. Games Econ. Behav. 55, 270\u2013296 (2006)","journal-title":"Games Econ. Behav."},{"key":"298_CR18","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s101070050044","volume":"85","author":"H. Marchand","year":"1999","unstructured":"Marchand H., Wolsey L.A.: The 0-1 knapsack problem with a single continuous variable. Math. Program. 85, 15\u201333 (1999)","journal-title":"Math. Program."},{"key":"298_CR19","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1287\/mnsc.29.4.430","volume":"29","author":"A. Mehrez","year":"1983","unstructured":"Mehrez A., Sinuany-Stern Z.: Resource allocation to interrelated risky projects using a multiattribute utility function. Manag. Sci. 29, 439\u2013490 (1983)","journal-title":"Manag. Sci."},{"key":"298_CR20","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1287\/moor.3.3.177","volume":"3","author":"G.L. Nemhauser","year":"1978","unstructured":"Nemhauser G.L., Wolsey L.A.: Best algorithms for approximating the maximum of a submodular function. Math. Oper. Res. 3, 177\u2013188 (1978)","journal-title":"Math. Oper. Res."},{"key":"298_CR21","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser G.L., Wolsey L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"298_CR22","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G.L. Nemhauser","year":"1978","unstructured":"Nemhauser G.L., Wolsey L.A., Fisher M.L.: An analysis of approximations for maximizing submodular set functions-I. Math. Program. 14, 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"298_CR23","first-page":"529","volume":"20","author":"P.J.H. Schoemaker","year":"1982","unstructured":"Schoemaker P.J.H.: The expected utility model: its variants, purposes, evidence and limitations. J. Econ. Lit. 20, 529\u2013563 (1982)","journal-title":"J. Econ. Lit."},{"key":"298_CR24","volume-title":"Theory of Games and Economic Behavior","author":"J. Neumann von","year":"1947","unstructured":"von Neumann J., Morgenstern O.: Theory of Games and Economic Behavior. Princeton University Press, Princeton (1947)"},{"key":"298_CR25","doi-asserted-by":"crossref","unstructured":"Vondrak, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: STOC 2008 Proceedings of the fourth annual ACM symposium on theory of computing, pp. 67\u201374. ACM (2008)","DOI":"10.1145\/1374376.1374389"},{"key":"298_CR26","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1287\/mnsc.12.7.485","volume":"12","author":"H.M. Weingartner","year":"1966","unstructured":"Weingartner H.M.: Capital budgeting of interrelated projects: survey and synthesis. Manag. Sci. 12, 485\u2013516 (1966)","journal-title":"Manag. Sci."},{"key":"298_CR27","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"L.A. Wolsey","year":"1975","unstructured":"Wolsey L.A.: Faces for linear inequality in 0-1 variables. Math. Program. 8, 165\u2013178 (1975)","journal-title":"Math. Program."},{"key":"298_CR28","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1287\/moor.2.1.66","volume":"2","author":"L.A. Wolsey","year":"1977","unstructured":"Wolsey L.A.: Valid inequalities and superadditivity for 0\/1 integer programs. Math. Oper. Res. 2, 66\u201377 (1977)","journal-title":"Math. Oper. Res."},{"key":"298_CR29","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0167-6377(89)90036-9","volume":"8","author":"L.A. Wolsey","year":"1988","unstructured":"Wolsey L.A.: Submodularity and valid inequalities in capacitated fixed charge networks. Oper. Res. Lett. 8, 119\u2013124 (1988)","journal-title":"Oper. Res. Lett."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-009-0298-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-009-0298-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-009-0298-1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-009-0298-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T19:38:37Z","timestamp":1710531517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-009-0298-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,8]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["298"],"URL":"https:\/\/doi.org\/10.1007\/s10107-009-0298-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,8]]}}}