A 2.75-approximation algorithm for the unconstrained traveling tournament problem

A 2.75-approximation algorithm for the unconstrained traveling tournament problem

A 2.75-approximation algorithm is proposed for the unconstrained traveling tournament problem, which is a variant of the traveling tournament problem. For the unconstrained traveling tournament problem, this is the first proposal of an approximation algorithm with a constant approximation ratio. In...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Annals of operations research 2014-07, Vol.218 (1), p.237-247
Hauptverfasser: Imahori, Shinji, Matsui, Tomomi, Miyashiro, Ryuhei
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Approximation
Approximation theory
Business and Management
Combinatorics
Computation
Constants
Games
Graphs
Management
Mathematical analysis
Mathematical models
Methods
Operations research
Operations Research/Decision Theory
Proposals
Scheduling
Scheduling (Management)
Sports
Studies
Teams
Theory of Computation
Tournaments
Tournaments & championships
Traveling salesman problem
Venue
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A 2.75-approximation algorithm is proposed for the unconstrained traveling tournament problem, which is a variant of the traveling tournament problem. For the unconstrained traveling tournament problem, this is the first proposal of an approximation algorithm with a constant approximation ratio. In addition, the proposed algorithm yields a solution that meets both the no-repeater and mirrored constraints. Computational experiments show that the algorithm generates solutions of good quality.
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-012-1161-y