A complete search method for the relaxed traveling tournament problem
Year of publication: |
2014
|
---|---|
Authors: | Brandão, Filipe ; Pedroso, João Pedro |
Published in: |
EURO journal on computational optimization. - Heidelberg : Springer, ISSN 2192-4406, ZDB-ID 2772752-X. - Vol. 2.2014, 1/2, p. 77-86
|
Subject: | Traveling tournament problem | Branch-and-bound | Metaheuristics | Dynamic programming | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Tourenplanung | Vehicle routing problem | Heuristik | Heuristics | Extensives Spiel | Extensive form game | Dynamische Optimierung |
-
Complexity of the unconstrained traveling tournament problem
Bhattacharyya, Rishiraj, (2016)
-
Minimizing takeoff and landing risk in helicopter pickup and delivery operations
Gribkovskaia, Irina, (2015)
-
Jin, Bo, (2023)
- More ...
-
Fast pattern-based algorithms for cutting stock
Brandão, Filipe, (2014)
-
Niche search and evolutionary optimisation
Pedroso, João Pedro, (1996)
-
Heuristics for packing semifluids
Pedroso, João Pedro, (2020)
- More ...