z-logo
open-access-imgOpen Access
Solving the Traveling Tournament Problem by Packing Three-Vertex Paths
Author(s) -
Marc Goerigk,
Richard Hoshino,
Kenichi Kawarabayashi,
Stephan Westphal
Publication year - 2014
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v28i1.9031
Subject(s) - tournament , schedule , mathematical optimization , vertex (graph theory) , integer programming , trips architecture , computer science , scheduling (production processes) , job shop scheduling , graph , benchmark (surveying) , mathematics , theoretical computer science , combinatorics , geography , parallel computing , geodesy , operating system

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom