Cover Image

Complexity of the unconstrained traveling tournament problem

Rishiraj Bhattacharyya
Year of publication:
September 2016
Authors: Bhattacharyya, Rishiraj
Published in:
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 44.2016, 5, p. 649-654
Subject: Scheduling | Traveling Tournament Problem | NP-hard | Scheduling-Verfahren | Scheduling problem | Tourenplanung | Vehicle routing problem | Theorie | Theory | Extensives Spiel | Extensive form game | Mathematische Optimierung | Mathematical programming
Online Resource
Check full text access |
Check Google Scholar
In libraries world-wide (WorldCat)
In German libraries (KVK)
subito order
I need help

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Please type the code from the image

For general questions please use this address.

Persistent link: https://www.econbiz.de/10011596598
Similar items by subject