{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T10:34:53Z","timestamp":1725878093610},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319517407"},{"type":"electronic","value":"9783319517414"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-51741-4_8","type":"book-chapter","created":{"date-parts":[[2017,1,6]],"date-time":"2017-01-06T03:06:46Z","timestamp":1483672006000},"page":"92-102","source":"Crossref","is-referenced-by-count":0,"title":["Balanced Optimization with Vector Costs"],"prefix":"10.1007","author":[{"given":"Annette M. C.","family":"Ficker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits C. R.","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,7]]},"reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0377-2217(96)00142-7","volume":"101","author":"R Ahuja","year":"1997","unstructured":"Ahuja, R.: The balanced linear programming problem. Eur. J. Oper. Res. 101(1), 29\u201338 (1997)","journal-title":"Eur. J. Oper. Res."},{"issue":"23","key":"8_CR2","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0166-218X(86)90041-7","volume":"15","author":"P Camerini","year":"1986","unstructured":"Camerini, P., Maffioli, F., Martello, S., Toth, P.: Most and least uniform spanning trees. Discrete Appl. Math. 15(23), 181\u2013197 (1986)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"8_CR3","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1002\/net.20053","volume":"45","author":"P Cappanera","year":"2005","unstructured":"Cappanera, P., Scutell\u00e0, M.G.: Balanced paths in acyclic networks: tractable cases and related approaches. Networks 45(2), 104\u2013111 (2005)","journal-title":"Networks"},{"key":"8_CR4","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.disopt.2014.08.005","volume":"14","author":"T Dokka","year":"2014","unstructured":"Dokka, T., Crama, Y., Spieksma, F.C.R.: Multi-dimensional vector assignment problems. Discrete Optim. 14, 111\u2013125 (2014)","journal-title":"Discrete Optim."},{"issue":"2","key":"8_CR5","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0166-218X(88)90062-5","volume":"20","author":"Z Galil","year":"1988","unstructured":"Galil, Z., Schieber, B.: On finding most uniform spanning trees. Discrete Appl. Math. 20(2), 173\u2013175 (1988)","journal-title":"Discrete Appl. Math."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Kamura, Y., Nakamori, M.: Modified balanced assignment problem in vector case: system construction problem. In: 2014 International Conference on Computational Science and Computational Intelligence (CSCI), vol. 2, pp. 52\u201356. IEEE (2014)","DOI":"10.1109\/CSCI.2014.94"},{"issue":"7","key":"8_CR7","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1002\/net.3230240705","volume":"24","author":"N Katoh","year":"1994","unstructured":"Katoh, N., Iwano, K.: Efficient algorithms for minimum range cut problems. Networks 24(7), 395\u2013407 (1994)","journal-title":"Networks"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Kinable, J., Smeulders, B., Delcour, E., Spieksma, F.C.R.: Exact algorithms for the Equitable Traveling Salesman Problem. Research report, KU Leuven (2016)","DOI":"10.2139\/ssrn.2770542"},{"issue":"5","key":"8_CR9","doi-asserted-by":"crossref","first-page":"868","DOI":"10.1016\/j.cor.2010.09.016","volume":"38","author":"J Larusic","year":"2011","unstructured":"Larusic, J., Punnen, A.: The balanced traveling salesman problem. Comput. Oper. Res. 38(5), 868\u2013875 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"8_CR10","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, W., Toth, P., De Werra, D.: Balanced optimization problems. Oper. Res. Lett. 3(5), 275\u2013278 (1984)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"8_CR11","first-page":"91","volume":"6","author":"L Turner","year":"2012","unstructured":"Turner, L.: Variants of shortest path problems. Algorithmic Oper. Res. 6(2), 91\u2013104 (2012)","journal-title":"Algorithmic Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51741-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T02:37:50Z","timestamp":1568687870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51741-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319517407","9783319517414"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51741-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}