{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T09:55:07Z","timestamp":1720086907747},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T00:00:00Z","timestamp":1114905600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2005,5]]},"DOI":"10.1016\/j.orl.2004.06.004","type":"journal-article","created":{"date-parts":[[2004,9,25]],"date-time":"2004-09-25T03:13:32Z","timestamp":1096082012000},"page":"235-241","source":"Crossref","is-referenced-by-count":36,"title":["A polynomial-time algorithm to find an equitable home\u2013away assignment"],"prefix":"10.1016","volume":"33","author":[{"given":"Ryuhei","family":"Miyashiro","sequence":"first","affiliation":[]},{"given":"Tomomi","family":"Matsui","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2004.06.004_bib1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","article-title":"A linear-time algorithm for testing the truth of certain quantified Boolean formulas","volume":"8","author":"Aspval","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.orl.2004.06.004_bib2","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0166-218X(80)90028-1","article-title":"Geography, games and graphs","volume":"2","author":"de Werra","year":"1980","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.orl.2004.06.004_bib3","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0166-218X(82)90042-7","article-title":"Minimizing irregularities in sports schedules using graph theory","volume":"4","author":"de Werra","year":"1982","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.orl.2004.06.004_bib4","series-title":"Practice and Theory of Automated Timetabling IV (Lecture Notes in Computer Science 2740)","first-page":"100","article-title":"Solving the traveling tournament problem","author":"Easton","year":"2003"},{"key":"10.1016\/j.orl.2004.06.004_bib5","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-6377(03)00025-7","article-title":"Minimizing breaks by maximizing cuts","volume":"31","author":"Elf","year":"2003","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.orl.2004.06.004_bib6","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","article-title":"Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming","volume":"42","author":"Goemans","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/j.orl.2004.06.004_bib7","series-title":"Practice and Theory of Automated Timetabling IV (Lecture Notes in Computer Science, Vol. 2740)","first-page":"78","article-title":"Characterizing feasible pattern sets with a minimum number of breaks","author":"Miyashiro","year":"2003"},{"key":"10.1016\/j.orl.2004.06.004_bib8","unstructured":"R. Miyashiro, T. Matsui, Semidefinite programming based approaches to the break minimization problem, METR 2003\u201328, University of Tokyo, August 2003."},{"key":"10.1016\/j.orl.2004.06.004_bib9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/opre.46.1.1","article-title":"Scheduling a major college basketball conference","volume":"46","author":"Nemhauser","year":"1998","journal-title":"Oper. Res."},{"key":"10.1016\/j.orl.2004.06.004_bib10","series-title":"Constraint Programming and Large Scale Discrete Optimization (DIMACS Series in Discrete Mathematics and Theoretical Computer Science 57)","first-page":"115","article-title":"Minimization of the number of breaks in sports scheduling problems using constraint programming","author":"R\u00e9gin","year":"2001"},{"key":"10.1016\/j.orl.2004.06.004_bib11","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0166-218X(82)90051-8","article-title":"Premature sets of 1-factors or how not to schedule round-robin tournaments","volume":"4","author":"Rosa","year":"1982","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.orl.2004.06.004_bib12","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1287\/opre.42.4.614","article-title":"Devising a cost effective schedule for a baseball league","volume":"42","author":"Russell","year":"1994","journal-title":"Oper. Res."},{"key":"10.1016\/j.orl.2004.06.004_bib13","series-title":"Practice and Theory of Automated Timetabling III (Lecture Notes in Computer Science, Vol. 2079)","first-page":"242","article-title":"A schedule-then-break approach to sports timetabling","author":"Trick","year":"2001"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637704000951?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637704000951?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T17:21:35Z","timestamp":1549214495000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637704000951"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,5]]}},"alternative-id":["S0167637704000951"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2004.06.004","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2005,5]]}}}