{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T14:07:08Z","timestamp":1773670028397,"version":"3.50.1"},"reference-count":10,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1051\/ro:2008028","type":"journal-article","created":{"date-parts":[[2008,10,13]],"date-time":"2008-10-13T15:10:20Z","timestamp":1223910620000},"page":"455-467","source":"Crossref","is-referenced-by-count":7,"title":["Acyclic Orientations with Path Constraints"],"prefix":"10.1051","volume":"42","author":[{"given":"Rosa M. V.","family":"Figueiredo","sequence":"first","affiliation":[]},{"given":"Valmir C.","family":"Barbosa","sequence":"additional","affiliation":[]},{"given":"Nelson","family":"Maculan","sequence":"additional","affiliation":[]},{"given":"Cid C.","family":"de Souza","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2009,4,4]]},"reference":[{"key":"R1","unstructured":"K. Aardal, A. Hipolito, C. van Hoesel, B. Jansen, C. Roos, and T. Terlaky,EUCLID CALMA radio link frequency assignment project: A branch-and-cut algorithm for the frequency assignment problem. Technical report, Delft and Eindhoven Universities of Technology, The Netherlands (1995)."},{"key":"R2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1142\/S0219265900000032","volume":"1","author":"Bermond","year":"2000","journal-title":"J. Interconnection Networks"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"J. Bermond, M. Di Ianni, M. Flammini, and S. Perennes, Acyclic orientations for deadlock prevention in interconnection networks, inProceedings of the Workshop on Graph-Theoretic Concepts in Computer Science(1997) 52\u201364.","DOI":"10.1007\/BFb0024487"},{"key":"R4","unstructured":"R. Bornd\u00f6rfer, A. Eisenbl\u00e4tter, M. Gr\u00f6tschel, and A. Martin,The orientation model for frequency assignment problems. Technical Report 98-01, Zuse Institute Berlin, Germany (1998)."},{"key":"R5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0095-8956(79)90048-0","volume":"26","author":"Deming","year":"1979","journal-title":"J. Combin. Theory Ser. B"},{"key":"R6","unstructured":"T. Gallai, On directed paths and circuits, inTheory of Graphsedited by P. Erd\u0151s and G. Katona, Academic Press, New York, NY (1968) 115\u2013118."},{"key":"R7","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01582010","volume":"33","author":"Gr\u00f6tschel","year":"1985","journal-title":"Math. Program."},{"key":"R8","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/BF01582009","volume":"33","author":"Gr\u00f6tschel","year":"1985","journal-title":"Math. Program."},{"key":"R9","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/S0167-739X(00)00046-7","volume":"16","author":"Maniezzo","year":"2000","journal-title":"Future Gener. Comput. Syst."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"B. Roy, Nombre chromatique et plus longs chemins d'un graphe,Revue AFIRO1(1967) 127\u2013132.","DOI":"10.1051\/m2an\/1967010501291"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2008028\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T16:22:12Z","timestamp":1557850932000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2008028"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10]]},"references-count":10,"journal-issue":{"issue":"4"},"alternative-id":["ro0805"],"URL":"https:\/\/doi.org\/10.1051\/ro:2008028","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10]]}}}