Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/329875
Type: Artigo
Title: Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm
Author: Oliveira, Lucas de
Souza, Cid C. de
Yunes, Tallys
Abstract: Given a double round-robin tournament, the Traveling Umpire Problem (TUP) seeks to assign umpires to the games of the tournament while minimizing the total distance traveled by the umpires. The assignment must satisfy constraints that prevent umpires from
Subject: Algoritmos branch-and-cut
Programação inteira
Complexidade computacional
Otimização combinatória
Country: Reino Unido
Editor: Elsevier
Citation: Computers & Operations Research. Pergamon-elsevier Science Ltd , v. 72, p. 147 - 159, 2016.
Rights: Fechado
Identifier DOI: 10.1016/j.cor.2016.02.014
Address: https://www.sciencedirect.com/science/article/pii/S0305054816300387
Date Issue: 2016
Appears in Collections:IC - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
000375502800013.pdf565.5 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.