scientific article; zbMATH DE number 2084735

MaRDI QIDQ4475665zbMATH OpenFDO

Authors Kelly K. Easton, G. L. Nemhauser, Michael A. Trick

Publication date 9 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2239/22390580.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• A combined local search and integer programming approach to the traveling tournament problem
• A simulated annealing and hill-climbing algorithm for the traveling tournament problem
• An improved approximation algorithm for the traveling tournament problem with maximum trip length two
• A complete search method for the relaxed traveling tournament problem

Cited in

(71)

• A Benders approach for computing lower bounds for the mirrored traveling tournament problem
• Constraint programming and operations research
• A new neighborhood structure for round robin scheduling problems
• Minimization of rest mismatches in round robin tournaments
• Scheduling Argentina's professional basketball leagues: a variation on the travelling tournament problem
• The stable tournament problem: matching sports schedules with preferences
• The sport teams grouping problem
• Scheduling double round-robin tournaments with divisional play using constraint programming
• Complexity of the unconstrained traveling tournament problem
• A wide-ranging computational comparison of high-performance graph colouring algorithms
• An ILS heuristic for the traveling tournament problem with predefined venues
• An approximation algorithm for the traveling tournament problem
• An XML format for benchmarks in high school timetabling
• On the separation in 2-period double round robin tournaments with minimum breaks
• Approximation algorithms for \(\mathrm{TTP(2)}\)
• A beam search approach to the traveling tournament problem
• Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021
• The traveling tournament problem with predefined venues
• RobinX: a three-field classification and unified data format for round-robin sports timetabling
• Scheduling a non-professional indoor football league: a tabu search based approach
• Competitive strategies for an online generalized assignment problem with a service consecution constraint
• Scheduling sports competitions at multiple venues -- revisited
• Round robin scheduling -- a survey
• Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
• A simulated annealing and hill-climbing algorithm for the traveling tournament problem
• A complete search method for the relaxed traveling tournament problem
• A new branch-and-price algorithm for the traveling tournament problem
• Optimal selection of touristic packages based on user preferences during sports mega-events
• A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem
• A further improvement on approximating TTP-2
• A combined local search and integer programming approach to the traveling tournament problem
• Benders' cuts guided large neighborhood search for the traveling umpire problem
• Decomposition and local search based methods for the traveling umpire problem
• Edge coloring: a natural model for sports scheduling
• An Improved Approximation Algorithm for the Traveling Tournament Problem
• A multi-round generalization of the traveling tournament problem and its application to Japanese baseball
• A 2.75-approximation algorithm for the unconstrained traveling tournament problem
• A 5.875-approximation for the traveling tournament problem
• Coloration de graphes : fondements et applications
• A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications
• A note on symmetry reduction for circular traveling tournament problems
• scientific article; zbMATH DE number 2230230 (Why is no real title available?)
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Unconstrained traveling tournament problem is APX-complete
• Confection de calendriers de matchs pour le sport universitaire et collégial au Québec
• A traditional Benders' approach to sports timetabling
• The international timetabling competition on sports timetabling (ITC2021)
• Round-robin scheduling with regard to rest differences
• Complexity of the traveling tournament problem
• Round robin tournaments and three index assignments
• An improved approximation algorithm for the traveling tournament problem
• Combinatorial models for scheduling sports tournaments
• The APX-hardness of the traveling tournament problem
• The traveling tournament problem: improved algorithms based on cycle packing
• A matching-based approximation algorithm for the traveling tournament problem
• A faster deterministic approximation algorithm for TTP-2
• On the initial transition of graphs of Kirkman schedules by the partial team swap
• Beyond leagues: a single incomplete round Robin tournament for multi-league sports timetabling
• Which algorithm to select in sports timetabling?
• Break maximization for round-robin tournaments without consecutive breaks
• A 5-approximation algorithm for the traveling tournament problem
• On the application of graph colouring techniques in round-robin sports scheduling
• Sport scheduling to minimize travels at the FIFA world cup 2026
• A Monte Carlo framework for procedural fixture fairness evaluation in league competitions
• Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America
• The timetable constrained distance minimization problem
• A Benders approach for the constrained minimum break problem
• Heuristics for the mirrored traveling tournament problem
• A simulated annealing approach to the traveling tournament problem
• Solving mirrored traveling tournament problem benchmark instances with eight teams
• On the existence of sports schedules with multiple venues

Describes a project that uses

Uses Software

• WSAT(OIP)

This page was built for publication:

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