{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:24:07Z","timestamp":1740108247871,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,2,9]],"date-time":"2018-02-09T00:00:00Z","timestamp":1518134400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s00186-018-0630-8","type":"journal-article","created":{"date-parts":[[2018,2,9]],"date-time":"2018-02-09T06:10:45Z","timestamp":1518156645000},"page":"99-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Generalized average shadow prices and bottlenecks"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7977-2916","authenticated-orcid":false,"given":"Alejandro","family":"Crema","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,9]]},"reference":[{"key":"630_CR1","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1057\/jors.1984.83","volume":"35","author":"MA Akgull","year":"1984","unstructured":"Akgull MA (1984) A note on shadow prices in linear programming. J Oper Res Soc 35:425\u2013431","journal-title":"J Oper Res Soc"},{"key":"630_CR2","doi-asserted-by":"publisher","first-page":"206","DOI":"10.2307\/1909864","volume":"34","author":"RE Alkaly","year":"1966","unstructured":"Alkaly RE, Klevorick AK (1966) A note on the dual prices of integer programs. Econometrica 34:206\u2013214","journal-title":"Econometrica"},{"key":"630_CR3","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1057\/jors.1982.118","volume":"33","author":"DC Aucamp","year":"1982","unstructured":"Aucamp DC, Steinberg DC (1982) The computation of shadow prices in linear programming. J Oper Res Soc 33:557\u2013565","journal-title":"J Oper Res Soc"},{"key":"630_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.disopt.2003.03.001","volume":"2","author":"F Barahona","year":"2005","unstructured":"Barahona F, Chudak FA (2005) Near-optimal solutions to large-scale facility location problems. Discrete Optim 2:35\u201350","journal-title":"Discrete Optim"},{"key":"630_CR5","volume-title":"Studies in computational intelligence","author":"MR Bonyadi","year":"2014","unstructured":"Bonyadi MR, Michalewicz Z (2014a) Evolutionary computation for real-world problems. Challenges in computational statistics and data mining. In: Matwin S, Mielnikzuk J (eds) Studies in computational intelligence. Springer, Berlin"},{"key":"630_CR6","doi-asserted-by":"crossref","unstructured":"Bonyadi MR, Michalewicz Z, Wagner M (2014b) Beyond the edge of feasibility: analysis of bottlenecks. Simulated Evolution and Learning Lecture Notes Computer Science, vol. 8886, pp 431\u2013442","DOI":"10.1007\/978-3-319-13563-2_37"},{"issue":"3","key":"630_CR7","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1016\/0377-2217(94)00003-U","volume":"85","author":"A Crema","year":"1995","unstructured":"Crema A (1995) Average shadow price in a mixed integer linear programming problem. Eur J Oper Res 85(3):625\u2013635","journal-title":"Eur J Oper Res"},{"key":"630_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0121039","volume":"24","author":"RM Freund","year":"1985","unstructured":"Freund RM (1985) Postoptimal analysis of a linear program under simultaneous changes in matrix coefficients. Math Program Stud 24:1\u201313","journal-title":"Math Program Stud"},{"key":"630_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BFb0121210","volume":"21","author":"T Gal","year":"1984","unstructured":"Gal T (1984) Linear parametric programming\u2014a brief survey. Math Program Stud 21:43\u201368","journal-title":"Math Program Stud"},{"key":"630_CR10","first-page":"59","volume":"8","author":"T Gal","year":"1986","unstructured":"Gal T (1986) Shadow prices and sensitivity analysis in linear programming under degeneracy. State Art Surv Oper Res Spectr 8:59\u201371","journal-title":"State Art Surv Oper Res Spectr"},{"key":"630_CR11","doi-asserted-by":"publisher","first-page":"521","DOI":"10.2307\/1910130","volume":"28","author":"RE Gomory","year":"1960","unstructured":"Gomory RE, Baumol WJ (1960) Integer programming and prices. Econometrica 28:521\u2013550","journal-title":"Econometrica"},{"issue":"2","key":"630_CR12","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1137\/110836183","volume":"23","author":"A Gupte","year":"2013","unstructured":"Gupte A, Ahmed S, Cheon MS, Dey S (2013) Solving mixed integer bilinear problems using milp formulations. SIAM J Optim 23(2):721\u2013744","journal-title":"SIAM J Optim"},{"issue":"1","key":"630_CR13","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0377-2217(96)00172-5","volume":"101","author":"B Jansen","year":"1997","unstructured":"Jansen B, Roos C, de Jong JJ, Terlaky T (1997) Sensitivity analysis in linear programming: just be careful!. Eur J Oper Res 101(1):15\u201328","journal-title":"Eur J Oper Res"},{"issue":"3","key":"630_CR14","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0377-2217(88)90195-6","volume":"37","author":"S Kim","year":"1988","unstructured":"Kim S, Cho S (1988) A shadow price in integer programming for management decision. Eur J Oper Res 37(3):328\u2013335","journal-title":"Eur J Oper Res"},{"issue":"1","key":"630_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF00939892","volume":"74","author":"S Kim","year":"1992","unstructured":"Kim S, Cho S (1992) Average shadow prices in mathematical programming. J Optim Theory Appl 74(1):57\u201374","journal-title":"J Optim Theory Appl"},{"key":"630_CR16","volume-title":"Knapsack problems, algorithms and computer implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack problems, algorithms and computer implementations. Wiley, New York"},{"issue":"3\/4","key":"630_CR17","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF00933875","volume":"17","author":"DH Martin","year":"1975","unstructured":"Martin DH (1975) On the continuity of the maximum in parametric linear programming. J Optim Theory Appl 17(3\/4):205\u2013210","journal-title":"J Optim Theory Appl"},{"issue":"1","key":"630_CR18","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.ejor.2004.06.019","volume":"169","author":"S Mukherjee","year":"2006","unstructured":"Mukherjee S, Chatterjeeb AK (2006a) The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price. Eur J Oper Res 169(1):53\u201364","journal-title":"Eur J Oper Res"},{"key":"630_CR19","unstructured":"Mukherjee S, Chatterjeeb AK (2006b) Unified concept of Bottleneck. Indian Institute of Management Ahmedabad-380015, India. W.P. No. 2006-05-01"},{"issue":"2","key":"630_CR20","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/ijoc.1090.0344","volume":"22","author":"J Puchinger","year":"2010","unstructured":"Puchinger J, Raidl G, Pferschy U (2010) The multidimensional knapsack problem: structure and algorithms. INFORMS J Comput 22(2):250\u2013265","journal-title":"INFORMS J Comput"},{"key":"630_CR21","volume-title":"Mathematical programming","author":"JF Shapiro","year":"1979","unstructured":"Shapiro JF (1979) Mathematical programming. Wiley, New York"},{"key":"630_CR22","first-page":"203","volume":"8","author":"HP Williams","year":"1997","unstructured":"Williams HP (1997) Integer programming revisited. IMA J Math Appl Bus Ind 8:203\u2013213","journal-title":"IMA J Math Appl Bus Ind"},{"key":"630_CR23","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1016\/j.ejor.2007.10.024","volume":"192","author":"T Yamada","year":"2009","unstructured":"Yamada T, Takeoka T (2009) An exact algorithm for the fixed-charge multiple knapsack problem. Eur J Oper Res 192:700\u2013705","journal-title":"Eur J Oper Res"},{"key":"630_CR24","unstructured":"Zuidwijk RA (2005) Linear parametric sensitivity analysis of the constraint coefficient matrix in linear programs. Erasmus Research Institute of Management, Report Series Research in Management"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-018-0630-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-018-0630-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-018-0630-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T13:56:51Z","timestamp":1570715811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-018-0630-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,9]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["630"],"URL":"https:\/\/doi.org\/10.1007\/s00186-018-0630-8","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"type":"print","value":"1432-2994"},{"type":"electronic","value":"1432-5217"}],"subject":[],"published":{"date-parts":[[2018,2,9]]},"assertion":[{"value":"16 November 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}