Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem

DOI10.1016/J.EJOR.2015.10.004MaRDI QIDQ322545zbMATH OpenOpenAlexFDO

Authors Túlio A. M. Toffolo, T. Wauters, Sam Van Malderen, Greet Vanden Berghe

Publication date 7 October 2016

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL http://www.repositorio.ufop.br/handle/123456789/7013

zbMATH Keywords

branch-and-bounddecomposition strategiestraveling umpire problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Recommendations

• Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm
• Decomposition and local search based methods for the traveling umpire problem
• Two exact algorithms for the traveling umpire problem
• Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic
• On the complexity of the traveling umpire problem

Cites work

• Algorithms for the Assignment and Transportation Problems
• An Automatic Method of Solving Discrete Programming Problems
• Benders' cuts guided large neighborhood search for the traveling umpire problem
• Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem
• Decomposition and local search based methods for the traveling umpire problem
• Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic
• Two exact algorithms for the traveling umpire problem

Cited in

(9)

• Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America
• The sport teams grouping problem
• An optimization approach to designing a baseball scout network
• Decomposition and local search based methods for the traveling umpire problem
• Two exact algorithms for the traveling umpire problem
• Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm
• On the complexity of the traveling umpire problem
• A new branch-and-price algorithm for the traveling tournament problem
• Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic

This page was built for publication: Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322545)