A new branch-and-price algorithm for the traveling tournament problem-Reference-Cited by-同舟云学术

A new branch-and-price algorithm for the traveling tournament problem

Published:2010-07 Issue:2 Volume:204 Page:218-228
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Irnich Stefan

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference19 articles.

1. Branching rules revisited;Achterberg;Operations Research Letters,2005

2. A branching scheme for finding cost-minimal round robin tournaments;Briskorn;European Journal of Operational Research,2009

3. Solving mirrored traveling tournament problem benchmark instances with eight teams;Cheung;Discrete Optimization,2008

4. A Benders approach for computing lower bounds for the mirrored traveling tournament problem;Cheung;Discrete Optimization,2009

5. A unified framework for deterministic time constrained vehicle routing and crew scheduling problems;Desaulniers,1998

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Approaching the Traveling Tournament Problem with Randomized Beam Search;Evolutionary Computation;2023

2. Integer Programming Approaches;EURO Advanced Tutorials on Operational Research;2023

3. A new approach based on graph matching and evolutionary approach for sport scheduling problem;Intelligent Decision Technologies;2021-01-06

4. Exact Branch-Price-and-Cut Algorithms for Vehicle Routing;Transportation Science;2019-07

5. A Novel Graph-Based Heuristic Approach for Solving Sport Scheduling Problem;Lecture Notes in Computer Science;2018