{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:57:09Z","timestamp":1725638229366},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255908"},{"type":"electronic","value":"9783642255915"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25591-5_55","type":"book-chapter","created":{"date-parts":[[2011,12,3]],"date-time":"2011-12-03T00:32:34Z","timestamp":1322872354000},"page":"534-543","source":"Crossref","is-referenced-by-count":11,"title":["Online Linear Optimization over Permutations"],"prefix":"10.1007","author":[{"given":"Shota","family":"Yasutake","sequence":"first","affiliation":[]},{"given":"Kohei","family":"Hatano","sequence":"additional","affiliation":[]},{"given":"Shuji","family":"Kijima","sequence":"additional","affiliation":[]},{"given":"Eiji","family":"Takimoto","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"55_CR1","doi-asserted-by":"crossref","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511804441"},{"key":"55_CR2","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"L.M. Bregman","year":"1967","unstructured":"Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Computational Mathematics and Physics\u00a07, 200\u2013217 (1967)","journal-title":"USSR Computational Mathematics and Physics"},{"key":"55_CR3","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Prediction, Learning, and Games. Cambridge University Press (2006)","DOI":"10.1017\/CBO9780511546921"},{"key":"55_CR4","unstructured":"Fujishige, S.: Submodular functions and optimization, 2nd edn. Elsevier Science (2005)"},{"key":"55_CR5","unstructured":"Hazan, E.: A survey: The convex optimization approach to regret minimization (2009), \n                    \n                      http:\/\/www.cs.princeton.edu\/~ehazan\/papers\/OCO-survey.pdf"},{"key":"55_CR6","first-page":"1705","volume":"10","author":"D.P. Helmbold","year":"2009","unstructured":"Helmbold, D.P., Warmuth, M.K.: Learning permutations with exponential weights. Journal of Machine Learning Research\u00a010, 1705\u20131736 (2009)","journal-title":"Journal of Machine Learning Research"},{"issue":"2","key":"55_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0167-5060(08)70323-6","volume":"2","author":"E.L. Lawler","year":"1978","unstructured":"Lawler, E.L.: On sequencing jobs to minimize weighted completion time subject to precedence constraints. Annals of Discrete Mathematics\u00a02(2), 75\u201390 (1978)","journal-title":"Annals of Discrete Mathematics"},{"key":"55_CR8","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/opre.26.1.22","volume":"26","author":"J. Lenstra","year":"1978","unstructured":"Lenstra, J., Kan, A.R.: Complexity of scheduling under precedence constraints. Operations Research\u00a026, 22\u201335 (1978)","journal-title":"Operations Research"},{"issue":"1","key":"55_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.16.1.1","volume":"16","author":"M. Queyranne","year":"1991","unstructured":"Queyranne, M., Wang, Y.: Single-machine scheduling polyhedra with precedence constraints. Mathematics of Operations Research\u00a016(1), 1\u201320 (1991)","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"55_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0166-218X(90)90089-U","volume":"28","author":"A. Arnim von","year":"1990","unstructured":"von Arnim, A., Faigle, U., Schrader, R.: The permutahedron of series-parallel posets. Discrete Applied Mathematics\u00a028(1), 3\u20139 (1990)","journal-title":"Discrete Applied Mathematics"},{"key":"55_CR11","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0166-218X(96)00044-3","volume":"72","author":"A. Arnim von","year":"1997","unstructured":"von Arnim, A., Schulz, A.S.: Facets of the generalized permutahedron of a poset. Discrete Applied Mathematics\u00a072, 179\u2013192 (1997)","journal-title":"Discrete Applied Mathematics"},{"key":"55_CR12","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8431-1","volume-title":"Lectures on Polytopes","author":"G.M. Ziegler","year":"1995","unstructured":"Ziegler, G.M.: Lectures on Polytopes. Graduate Texts in Mathematics, vol.\u00a0152. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25591-5_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T03:51:37Z","timestamp":1555732297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25591-5_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255908","9783642255915"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25591-5_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}