Solving the traveling tournament problem with iterative-deepening A∗-Reference-Cited by-同舟云学术

Solving the traveling tournament problem with iterative-deepening A∗

Published:2011-05-17 Issue:5 Volume:15 Page:601-614
ISSN:1094-6136
Container-title:Journal of Scheduling
language:en
Short-container-title:J Sched

Author:

Uthus David C.,Riddle Patricia J.,Guesgen Hans W.

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Management Science and Operations Research,General Engineering,Software

Link

http://link.springer.com/content/pdf/10.1007/s10951-011-0237-x.pdf

Reference23 articles.

1. Benoist, T., Laburthe, F., & Rottembourg, B. (2001). Lagrange relaxation and constraint programming collaborative schemes for travelling tournament problems. In CP-AI-OR 2001 (pp. 15–26). Wye College, UK.

2. Dechter, R. (2003). Constraint processing. San Francisco: Morgan Kaufmann.

3. Easton, K., Nemhauser, G. L., & Trick, M. A. (2001). The traveling tournament problem: Description and benchmarks. In T. Walsh (Ed.), Lecture notes in computer science (Vol. 2239, pp. 580–584). Berlin: Springer.

4. Lecture notes in computer science;K. Easton,2003

5. Gschwind, T., & Irnich, S. (2011). A note on symmetry reduction for circular traveling tournament problems. European Journal of Operational Research, 210(2), 452–456.

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

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

2. A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem;Discrete Optimization;2022-11

3. Parallel Beam Search for Combinatorial Optimization;Workshop Proceedings of the 51st International Conference on Parallel Processing;2022-08-29

4. Research on path planning of three-neighbor search A* algorithm combined with artificial potential field;International Journal of Advanced Robotic Systems;2021-05-01

5. An Instance Data Repository for the Round-robin Sports Timetabling Problem;Management and Labour Studies;2020-04-24