{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:23:07Z","timestamp":1763641387403},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,10,16]],"date-time":"2010-10-16T00:00:00Z","timestamp":1287187200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s00186-010-0331-4","type":"journal-article","created":{"date-parts":[[2010,10,14]],"date-time":"2010-10-14T21:13:21Z","timestamp":1287090801000},"page":"19-27","source":"Crossref","is-referenced-by-count":5,"title":["On generalized balanced optimization problems"],"prefix":"10.1007","volume":"73","author":[{"given":"Lara","family":"Turner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abraham P.","family":"Punnen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yash P.","family":"Aneja","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Horst W.","family":"Hamacher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,10,16]]},"reference":[{"key":"331_CR1","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1287\/opre.38.1.178","volume":"38","author":"O Berman","year":"1990","unstructured":"Berman O, Einav D, Handler G (1990) The constrained bottleneck problem in networks. Oper Res 38: 178\u2013181","journal-title":"Oper Res"},{"key":"331_CR2","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.disopt.2006.07.004","volume":"4","author":"J B\u0142a\u017cewicz","year":"2007","unstructured":"B\u0142a\u017cewicz J, Formanowicz P, Kasprzak M, Schuurman P, Woeginger GJ (2007) A polynomial time equivalence between DNA sequencing and the exact perfect matching problem. Discrete Optim 4: 154\u2013162","journal-title":"Discrete Optim"},{"key":"331_CR3","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1137\/0402002","volume":"2","author":"PM Camerini","year":"1989","unstructured":"Camerini PM, Hamacher HW (1989) Intersection of two matroids: (condensed) border graphs and ranking. SIAM J Discrete Math 2: 16\u201327","journal-title":"SIAM J Discrete Math"},{"key":"331_CR4","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.orl.2005.04.003","volume":"34","author":"VG Dei\u030cneko","year":"2006","unstructured":"Dei\u030cneko VG, Woeginger GJ (2006) On the robust assignment problem under a fixed number of cost scenarios. Oper Res Lett 34: 175\u2013179","journal-title":"Oper Res Lett"},{"key":"331_CR5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0021-9800(70)80083-7","volume":"8","author":"J Edmonds","year":"1970","unstructured":"Edmonds J, Fulkerson DR (1970) Bottleneck extrema. J Combin Theory 8: 299\u2013306","journal-title":"J Combin Theory"},{"key":"331_CR6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.orl.2008.09.007","volume":"37","author":"J Gorski","year":"2009","unstructured":"Gorski J, Ruzika S (2009) On k-max-optimization. Oper Res Lett 37: 23\u201326","journal-title":"Oper Res Lett"},{"key":"331_CR7","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0167-6377(91)90061-S","volume":"10","author":"HW Hamacher","year":"1991","unstructured":"Hamacher HW, Rendl F (1991) Color constrained combinatorial optimization problems. Oper Res Lett 10: 211\u2013219","journal-title":"Oper Res Lett"},{"key":"331_CR8","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1007\/BF01068796","volume":"23","author":"AV Karzanov","year":"1987","unstructured":"Karzanov AV (1987) Maximum matching of given weight in complete and complete bipartite graphs. Cybern Syst Anal 23: 8\u201313","journal-title":"Cybern Syst Anal"},{"key":"331_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin"},{"key":"331_CR10","volume-title":"Combinatorial optimization: networks and matroids","author":"EL Lawler","year":"2001","unstructured":"Lawler EL (2001) Combinatorial optimization: networks and matroids. Dover Publications, Mineola"},{"key":"331_CR11","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0012-365X(88)90143-4","volume":"73","author":"M Leclerc","year":"1988\u20131989","unstructured":"Leclerc M (1988\u20131989) Optimizing over a slice of the bipartite matching polytope. Discrete Math 73: 159\u2013162","journal-title":"Discrete Math"},{"key":"331_CR12","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1287\/opre.40.4.813","volume":"40","author":"J Lee","year":"1992","unstructured":"Lee J (1992) On constrained bottleneck extrema. Oper Res 40: 813\u2013814","journal-title":"Oper Res"},{"key":"331_CR13","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0167-6377(84)90061-0","volume":"3","author":"S Martello","year":"1984","unstructured":"Martello S, Pulleyblank WR, Toth P, de Werra D (1984) Balanced optimization problems. Oper Res Lett 3: 275\u2013278","journal-title":"Oper Res Lett"},{"key":"331_CR14","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0167-6377(03)00065-8","volume":"32","author":"AP Punnen","year":"2004","unstructured":"Punnen AP, Aneja YP (2004) Lexicographic balanced optimization problems. Oper Res Lett 32: 27\u201330","journal-title":"Oper Res Lett"},{"key":"331_CR15","first-page":"183","volume":"3","author":"\u015e \u0162igan","year":"2005","unstructured":"\u0162igan \u015e, Iacob EM, Stancu-Minasian IM (2005) Monotonic balanced optimization problem. Ann Tiberiu Popoviciu Seminar Funct Equ Approx Convex 3: 183\u2013197","journal-title":"Ann Tiberiu Popoviciu Seminar Funct Equ Approx Convex"},{"key":"331_CR16","first-page":"105","volume":"6","author":"\u015e \u0162igan","year":"2008","unstructured":"\u0162igan \u015e, Stancu-Minasian IM, Coman I, Iacob ME (2008) On some stochastic balanced optimization problems. Ann Tiberiu Popoviciu Seminar Funct Equ Approx Convex 6: 105\u2013127","journal-title":"Ann Tiberiu Popoviciu Seminar Funct Equ Approx Convex"},{"key":"331_CR17","unstructured":"Turner L (2011) Universal combinatorial optimization problems. PhD thesis, Technical University of Kaiserslautern (to appear)"},{"key":"331_CR18","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0166-218X(01)00300-6","volume":"121","author":"T Yi","year":"2002","unstructured":"Yi T, Murty KG, Spera C (2002) Matchings in colored bipartite networks. Discrete Appl Math 121: 261\u2013277","journal-title":"Discrete Appl Math"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-010-0331-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-010-0331-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-010-0331-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T10:33:29Z","timestamp":1558607609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-010-0331-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,16]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["331"],"URL":"https:\/\/doi.org\/10.1007\/s00186-010-0331-4","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,16]]}}}