{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:27:17Z","timestamp":1759847237576},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,11,7]],"date-time":"2013-11-07T00:00:00Z","timestamp":1383782400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10287-013-0197-z","type":"journal-article","created":{"date-parts":[[2013,11,6]],"date-time":"2013-11-06T12:27:01Z","timestamp":1383740821000},"page":"197-218","source":"Crossref","is-referenced-by-count":10,"title":["The maximum ratio clique problem"],"prefix":"10.1007","volume":"12","author":[{"given":"Samyukta","family":"Sethuraman","sequence":"first","affiliation":[]},{"given":"Sergiy","family":"Butenko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,11,7]]},"reference":[{"key":"197_CR1","doi-asserted-by":"crossref","unstructured":"Billionnet A (2002) Approximation algorithms for fractional knapsack problems. Oper Res Lett 30(5): 336\u2013342","DOI":"10.1016\/S0167-6377(02)00157-8"},{"key":"197_CR2","doi-asserted-by":"crossref","first-page":"3171","DOI":"10.1016\/j.cor.2005.01.027","volume":"33","author":"V Boginski","year":"2006","unstructured":"Boginski V, Butenko S, Pardalos P (2006) Mining market data: a network approach. Comput Oper Res 33:3171\u20133184","journal-title":"Comput Oper Res"},{"key":"197_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4757-3023-4_1","volume-title":"Handbook of combinatorial optimization","author":"IM Bomze","year":"1999","unstructured":"Bomze IM, Budinich M, Pardalos PM, Pelillo M (1999) The maximum clique problem. In: Du DZ, Pardalos PM (eds) Handbook of combinatorial optimization. Kluwer Academic Publishers, Dordrecht, pp 1\u201374"},{"issue":"4","key":"197_CR4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/net.3230070405","volume":"7","author":"R Chandrasekaran","year":"1977","unstructured":"Chandrasekaran R (1977) Minimal ratio spanning trees. Networks 7(4):335\u2013342","journal-title":"Networks"},{"key":"197_CR5","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0167-5060(08)70387-X","volume":"55","author":"V Chv\u00e1tal","year":"1993","unstructured":"Chv\u00e1tal V, Slater P (1993) A note on well-covered graphs. Ann Discrete Math 55:179\u2013182","journal-title":"Ann Discrete Math"},{"key":"197_CR6","first-page":"77","volume-title":"Theory of graphs","author":"GB Dantzig","year":"1967","unstructured":"Dantzig GB, Blattner WO, Rao MR (1967) Finding a cycle in a graph with minimum cost to time ratio with application to a ship routing problem. In: Rosentlehl P (ed) Theory of graphs. Gordon and Breach, New York, pp 77\u201384"},{"issue":"10","key":"197_CR7","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1109\/43.728912","volume":"17","author":"A Dasdan","year":"1998","unstructured":"Dasdan A, Gupta R (1998) Faster maximum and minimum mean cycle algorithms for system-performance analysis. IEEE Trans Comput Aided Des Integr Circ Syst 17(10):889\u2013899","journal-title":"IEEE Trans Comput Aided Des Integr Circ Syst"},{"issue":"7","key":"197_CR8","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1287\/mnsc.13.7.492","volume":"13","author":"W Dinkelbach","year":"1967","unstructured":"Dinkelbach W (1967) On nonlinear fractional programming. Manag Sci 13(7):492\u2013498","journal-title":"Manag Sci"},{"key":"197_CR9","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1016\/j.orl.2005.01.004","volume":"33","author":"S Elhedhli","year":"2005","unstructured":"Elhedhli S (2005) Exact solution of a class of nonlinear knapsack problems. Oper Res Lett 33:615\u2013624","journal-title":"Oper Res Lett"},{"issue":"3","key":"197_CR10","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1287\/opre.17.3.546","volume":"17","author":"B Fox","year":"1969","unstructured":"Fox B (1969) Finding minimal cost-time ratio circuits. Oper Res 17(3):546\u2013551","journal-title":"Oper Res"},{"key":"197_CR11","volume-title":"Computers and Intractability: a Guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and Intractability: a Guide to the theory of NP-completeness. W.H. Freeman and Company, New York"},{"key":"197_CR12","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02591871","volume":"26","author":"T Ibaraki","year":"1983","unstructured":"Ibaraki T (1983) Parametric approaches to fractional programs. Math Program 26:345\u2013362","journal-title":"Math Program"},{"issue":"1\u20132","key":"197_CR13","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/nav.3800030108","volume":"3","author":"JR Isbell","year":"1956","unstructured":"Isbell JR, Marlow WH (1956) Attrition games. Naval Res Logist Q 3(1\u20132):71\u201394","journal-title":"Naval Res Logist Q"},{"issue":"3","key":"197_CR14","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(78)90011-0","volume":"23","author":"RM Karp","year":"1978","unstructured":"Karp RM (1978) A characterization of the minimum cycle mean in a digraph. Discrete Math 23(3):309\u2013311","journal-title":"Discrete Math"},{"key":"197_CR15","unstructured":"Lawler EL (1976) Combinatorial optimization: networks and matroids. Holt, Rinehart and Winston, New York"},{"key":"197_CR16","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02289146","volume":"14","author":"R Luce","year":"1949","unstructured":"Luce R, Perry A (1949) A method of matrix analysis of group structure. Psychometrika 14:95\u2013116","journal-title":"Psychometrika"},{"issue":"4","key":"197_CR17","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N Megiddo","year":"1979","unstructured":"Megiddo N (1979) Combinatorial optimization with rational objective functions. Math Oper Res 4(4):414\u2013424","journal-title":"Math Oper Res"},{"key":"197_CR18","unstructured":"NREL: transmission grid integration - data and resources (2012). http:\/\/www.nrel.gov\/electricity\/transmission\/data_resources.html . Accessed October 2013"},{"key":"197_CR19","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01586040","volume":"54","author":"JB Orlin","year":"1992","unstructured":"Orlin JB, Ahuja RK (1992) New scaling algorithms for the assignment and minimum mean cycle problems. Math Program 54:41\u201356","journal-title":"Math Program"},{"key":"197_CR20","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/net.3230120206","volume":"12","author":"JC Picard","year":"1982","unstructured":"Picard JC, Queyranne M (1982) A network flow solution to some nonlinear 0\u20131 programming problems, with applications to graph theory. Networks 12:141\u2013159","journal-title":"Networks"},{"key":"197_CR21","unstructured":"Prokopyev O, Meneses C, Oliveira C, Pardalos P (2005) On multiple-ratio hyperbolic 0\u20131 programming problems. Pac J Optim 1(2):327\u2013345"},{"issue":"3","key":"197_CR22","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/j.orl.2004.05.011","volume":"33","author":"OA Prokopyev","year":"2005","unstructured":"Prokopyev OA, Huang H, Pardalos PM (2005) On complexity of unconstrained hyperbolic 0\u20131 programming problems. Oper Res Lett 33(3):312\u2013318","journal-title":"Oper Res Lett"},{"key":"197_CR23","doi-asserted-by":"crossref","unstructured":"Radzik T (1998) Fractional combinatorial optimization. In: Du DZ, Pardalos P (eds) Handbook of combinatorial optimization, vol 1. Kluwer Academic Publishers, pp 429\u2013478","DOI":"10.1007\/978-1-4613-0303-9_6"},{"key":"197_CR24","doi-asserted-by":"crossref","unstructured":"Radzik T (1992) Newton\u2019s method for fractional combinatorial optimization. In: Proceedings of 33rd annual symposium on foundations of computer science, pp 659\u2013669","DOI":"10.1109\/SFCS.1992.267785"},{"key":"197_CR25","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/net.3230220304","volume":"22","author":"R Sankaranarayana","year":"1992","unstructured":"Sankaranarayana R, Stewart L (1992) Complexity results for well-covered graphs. Networks 22:247\u2013262","journal-title":"Networks"},{"key":"197_CR26","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0166-218X(93)00094-G","volume":"56","author":"M Shigeno","year":"1995","unstructured":"Shigeno M, Saruwatari Y, Matsui T (1995) An algorithm for fractional assignment problems. Discrete Appl Math 56:333\u2013343","journal-title":"Discrete Appl Math"},{"key":"197_CR27","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s10898-004-5119-8","volume":"30","author":"C Skiscim","year":"2004","unstructured":"Skiscim C, Palocsay S (2004) The complexity of minimum ratio spanning tree problems. J Glob Optim 30:335\u2013346","journal-title":"J Glob Optim"},{"key":"197_CR28","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1023\/A:1021279918708","volume":"24","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani M, Ahmed S, Sahinidis NV (2002) Global optimization of 0\u20131 hyperbolic programs. J Glob Optim 24:385\u2013416","journal-title":"J Glob Optim"},{"key":"197_CR29","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1007\/s10898-011-9832-9","volume":"56","author":"O Ursulenko","year":"2013","unstructured":"Ursulenko O, Butenko S, Prokopyev O (2013) A global optimization algorithm for solving the minimum multiple ratio spanning tree problem. J Glob Optim 56:1029\u20131043","journal-title":"J Glob Optim"},{"key":"197_CR30","unstructured":"Wiser R, Lantz E, Bolinger M, Hand M (2012) Recent developments in the levelized cost of energy from us wind power projects. http:\/\/eetd.lbl.gov\/ea\/emp\/reports\/wind-energy-costs-2-2012.pdf . Accessed October 2013"},{"issue":"1","key":"197_CR31","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/S0377-2217(96)00258-5","volume":"101","author":"T Wu","year":"1997","unstructured":"Wu T (1997) A note on a global approach for general 0\u20131 fractional programming. Eur J Oper Res 101(1):220\u2013223","journal-title":"Eur J Oper Res"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-013-0197-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-013-0197-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-013-0197-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:51Z","timestamp":1559131971000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-013-0197-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,7]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["197"],"URL":"https:\/\/doi.org\/10.1007\/s10287-013-0197-z","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,7]]}}}