A game theoretic approach to decentralized multi-project scheduling. - Tony Wauters; Katja Verbeeck; Greet Vanden Berghe; Patrick De Causmaecker (AAMAS, 2010)

Learning agents for the multi-mode project scheduling problem. - Tony Wauters; Katja Verbeeck; Greet Vanden Berghe; Patrick De Causmaecker (J. Oper. Res. Soc., 2011)

Fast Permutation Learning. - Tony Wauters; Katja Verbeeck; Patrick De Causmaecker; Greet Vanden Berghe (LION, 2012)

Real-world production scheduling for the food industry: An integrated approach. - Tony Wauters; Katja Verbeeck; Paul Verstraete; Greet Vanden Berghe; Patrick De Causmaecker (Eng. Appl. Artif. Intell., 2012)

A Guide-and-Observe Hyper-Heuristic Approach to the Eternity II Puzzle. - Tony Wauters; Wim Vancroonenburg; Greet Vanden Berghe (J. Math. Model. Algorithms, 2012)

Reinforcement Learning Enhanced Heuristic Search for CombinatorialOptimizationReinforcement Learning Enhanced Heuristic Search for CombinatorialOptimization (Reinforcement Learning gebaseerde heuristieken voorcombinatorische optimalisatie). - Tony Wauters (2012)

An effective shaking procedure for 2D and 3D strip packing problems. - Tony Wauters; Jannes Verstichel; Greet Vanden Berghe (Comput. Oper. Res., 2013)

Boosting Metaheuristic Search Using Reinforcement Learning. - Tony Wauters; Katja Verbeeck; Patrick De Causmaecker; Greet Vanden Berghe (Hybrid Metaheuristics, 2013)

The concrete delivery problem. - Joris Kinable; Tony Wauters; Greet Vanden Berghe (Comput. Oper. Res., 2014)

Decomposition and local search based methods for the traveling umpire problem. - Tony Wauters; Sam Van Malderen; Greet Vanden Berghe (Eur. J. Oper. Res., 2014)

A learning-based optimization approach to multi-project scheduling. - Tony Wauters; Katja Verbeeck; Patrick De Causmaecker; Greet Vanden Berghe (J. Sched., 2015)

Neighborhood Composition Strategies in Stochastic Local Search. - Janniele A. S. Araujo; Haroldo G. Santos; Davi D. Baltar; Túlio A. M. Toffolo; Tony Wauters (HM, 2016)

A decomposition approach to dual shuttle automated storage and retrieval systems. - Tony Wauters; Fulgencia Villa; Jan Christiaens; Ramón Alvarez-Valdés; Greet Vanden Berghe (Comput. Ind. Eng., 2016)

Branch-and-bound with decomposition-based lower bounds for the Traveling Umpire Problem. - Túlio A. M. Toffolo; Tony Wauters; Sam Van Malderen; Greet Vanden Berghe (Eur. J. Oper. Res., 2016)

The one-dimensional cutting stock problem with sequence-dependent cut losses. - Michele Garraffa; Fabio Salassa; Wim Vancroonenburg; Greet Vanden Berghe; Tony Wauters (Int. Trans. Oper. Res., 2016)

The Multi-Mode Resource-Constrained Multi-Project Scheduling Problem - The MISTA 2013 challenge. - Tony Wauters; Joris Kinable; Pieter Smet; Wim Vancroonenburg; Greet Vanden Berghe; Jannes Verstichel (J. Sched., 2016)

MILP and Max-Clique based heuristics for the Eternity II puzzle. - Fabio Salassa; Wim Vancroonenburg; Tony Wauters; Federico Della Croce; Greet Vanden Berghe (CoRR, 2017)

Multi-machine energy-aware scheduling. - David Van Den Dooren; Thomas Sys; Túlio A. M. Toffolo; Tony Wauters; Greet Vanden Berghe (EURO J. Comput. Optim., 2017)

A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem. - Túlio A. M. Toffolo; Eline Esprit; Tony Wauters; Greet Vanden Berghe (Eur. J. Oper. Res., 2017)

Stochastic local search with learning automaton for the swap-body vehicle routing problem. - Túlio A. M. Toffolo; Jan Christiaens; Sam Van Malderen; Tony Wauters; Greet Vanden Berghe (Comput. Oper. Res., 2018)

Exact methods for three-dimensional cutting and packing: A comparative study concerning single container problems. - Everton Fernandes da Silva; Túlio Ângelo Machado Toffolo; Tony Wauters (Comput. Oper. Res., 2019)

Heuristics for vehicle routing problems: Sequence or set optimization? - Túlio A. M. Toffolo; Thibaut Vidal; Tony Wauters (Comput. Oper. Res., 2019)

A matheuristic framework for the Three-dimensional Single Large Object Placement Problem with practical constraints. - Everton Fernandes da Silva; Aline Aparecida de Souza Leão; Franklina Maria Bragion Toledo; Tony Wauters (Comput. Oper. Res., 2020)

Exploring search space trees using an adapted version of Monte Carlo tree search for a combinatorial optimization problem. - Jorik Jooken; Pieter Leyman; Patrick De Causmaecker; Tony Wauters (CoRR, 2020)

The prisoner transportation problem. - Jan Christiaens; Hatice Çalik; Tony Wauters; Reshma Chirayil Chandrasekharan; Greet Vanden Berghe (Eur. J. Oper. Res., 2020)

A heuristic approach to feasibility verification for truck loading. - Vinícius Gandra; Hatice Çalik; Tony Wauters; Greet Vanden Berghe (GECCO Companion, 2021)

Neighborhood Enumeration in Local Search Metaheuristics. - Michiel Van Lancker; Greet Vanden Berghe; Tony Wauters (OLA, 2021)

The impact of loading restrictions on the two-echelon location routing problem. - Vinícius Gandra Martins Santos; Hatice Çalik; Tony Wauters; Túlio A. M. Toffolo; Marco Antonio Moreira de Carvalho; Greet Vanden Berghe (Comput. Ind. Eng., 2021)

Extracting maximal objects from three-dimensional solid materials. - Everton Fernandes da Silva; Hatice Çalik; Wim Vancroonenburg; Aline Aparecida de Souza Leão; Tony Wauters (Comput. Oper. Res., 2021)

A fast and scalable algorithm to solve nesting problems using a semi-discrete representation. - Sahar Chehrazad; Dirk Roose; Tony Wauters (CoRR, 2021)

An automatic constructive matheuristic for the shift minimization personnel task scheduling problem. - Reshma Chirayil Chandrasekharan; Pieter Smet; Tony Wauters (J. Heuristics, 2021)

Dispatch and conflict-free routing of capacitated vehicles with storage stack allocation. - Emmanouil Thanos; Tony Wauters; Greet Vanden Berghe (J. Oper. Res. Soc., 2021)

A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation. - Sahar Chehrazad; Dirk Roose; Tony Wauters (Eur. J. Oper. Res., 2022)

A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints. - Jeroen Gardeyn; Tony Wauters (Eur. J. Oper. Res., 2022)

Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems. - Jorik Jooken; Pieter Leyman; Tony Wauters; Patrick De Causmaecker (Comput. Oper. Res., 2023)

Instance space analysis for 2D bin packing mathematical models. - Chang Liu 124; Kate Smith-Miles; Tony Wauters; Alysson M. Costa (Eur. J. Oper. Res., 2024)

Efficient use of collision detection for volume maximization problems. - Jonas Tollenaere; Hatice Çalik; Tony Wauters (Eur. J. Oper. Res., 2024)

The exam location problem: Mathematical formulations and variants. - Hatice Çalik; Tony Wauters; Greet Vanden Berghe (Comput. Oper. Res., 2024)

A block-building constraint programming model for the container loading problem. - Chang Liu 124; Kate Smith-Miles; Tony Wauters; Alysson M. Costa (Comput. Oper. Res., 2025)

Decoupling Geometry from Optimization in 2D Irregular Cutting and Packing Problems: an Open-Source Collision Detection Engine. - Jeroen Gardeyn; Greet Vanden Berghe; Tony Wauters (CoRR, 2025)