default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTony Wauters
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Hatice Çalik
, Tony Wauters, Greet Vanden Berghe:
The exam location problem: Mathematical formulations and variants. Comput. Oper. Res. 161: 106438 (2024)- [j28]Chang Liu, Kate Smith-Miles, Tony Wauters, Alysson M. Costa:
Instance space analysis for 2D bin packing mathematical models. Eur. J. Oper. Res. 315(2): 484-498 (2024) - [j27]Jonas Tollenaere, Hatice Çalik, Tony Wauters:
Efficient use of collision detection for volume maximization problems. Eur. J. Oper. Res. 319(3): 967-982 (2024) - 2023
- [j26]Jorik Jooken, Pieter Leyman, Tony Wauters, Patrick De Causmaecker:
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems. Comput. Oper. Res. 150: 106070 (2023) - 2022
- [j25]Sahar Chehrazad, Dirk Roose, Tony Wauters:
A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation. Eur. J. Oper. Res. 300(3): 809-826 (2022) - [j24]Jeroen Gardeyn, Tony Wauters:
A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints. Eur. J. Oper. Res. 301(2): 432-444 (2022) - 2021
- [j23]Vinícius Gandra Martins Santos, Hatice Çalik, Tony Wauters, Túlio A. M. Toffolo, Marco Antonio Moreira de Carvalho, Greet Vanden Berghe:
The impact of loading restrictions on the two-echelon location routing problem. Comput. Ind. Eng. 160: 107609 (2021) - [j22]Everton Fernandes da Silva, Hatice Çalik, Wim Vancroonenburg, Aline Aparecida de Souza Leão, Tony Wauters:
Extracting maximal objects from three-dimensional solid materials. Comput. Oper. Res. 132: 105290 (2021) - [j21]Reshma Chirayil Chandrasekharan, Pieter Smet, Tony Wauters:
An automatic constructive matheuristic for the shift minimization personnel task scheduling problem. J. Heuristics 27(1-2): 205-227 (2021) - [j20]Emmanouil Thanos, Tony Wauters, Greet Vanden Berghe:
Dispatch and conflict-free routing of capacitated vehicles with storage stack allocation. J. Oper. Res. Soc. 72(8): 1780-1793 (2021) - [c5]Vinícius Gandra, Hatice Çalik, Tony Wauters, Greet Vanden Berghe:
A heuristic approach to feasibility verification for truck loading. GECCO Companion 2021: 1564-1569 - [c4]Michiel Van Lancker, Greet Vanden Berghe, Tony Wauters:
Neighborhood Enumeration in Local Search Metaheuristics. OLA 2021: 229-240 - [i4]Sahar Chehrazad, Dirk Roose, Tony Wauters:
A fast and scalable algorithm to solve nesting problems using a semi-discrete representation. CoRR abs/2103.08739 (2021) - 2020
- [j19]Everton Fernandes da Silva, Aline Aparecida de Souza Leão, Franklina Maria Bragion Toledo, Tony Wauters:
A matheuristic framework for the Three-dimensional Single Large Object Placement Problem with practical constraints. Comput. Oper. Res. 124: 105058 (2020) - [j18]Jan Christiaens, Hatice Çalik, Tony Wauters, Reshma Chirayil Chandrasekharan, Greet Vanden Berghe:
The prisoner transportation problem. Eur. J. Oper. Res. 284(3): 1058-1073 (2020) - [i3]Jorik Jooken, Pieter Leyman, Patrick De Causmaecker, Tony Wauters:
Exploring search space trees using an adapted version of Monte Carlo tree search for a combinatorial optimization problem. CoRR abs/2010.11523 (2020)
2010 – 2019
- 2019
- [j17]Túlio A. M. Toffolo, Thibaut Vidal, Tony Wauters:
Heuristics for vehicle routing problems: Sequence or set optimization? Comput. Oper. Res. 105: 118-131 (2019) - [j16]Everton Fernandes da Silva, Túlio Ângelo Machado Toffolo, Tony Wauters:
Exact methods for three-dimensional cutting and packing: A comparative study concerning single container problems. Comput. Oper. Res. 109: 12-27 (2019) - 2018
- [j15]Túlio A. M. Toffolo, Jan Christiaens, Sam Van Malderen, Tony Wauters, Greet Vanden Berghe:
Stochastic local search with learning automaton for the swap-body vehicle routing problem. Comput. Oper. Res. 89: 68-81 (2018) - [i2]Túlio A. M. Toffolo, Thibaut Vidal, Tony Wauters:
Heuristics for vehicle routing problems: Sequence or set optimization? CoRR abs/1803.06062 (2018) - 2017
- [j14]David Van Den Dooren, Thomas Sys, Túlio A. M. Toffolo, Tony Wauters, Greet Vanden Berghe:
Multi-machine energy-aware scheduling. EURO J. Comput. Optim. 5(1-2): 285-307 (2017) - [j13]Túlio A. M. Toffolo, Eline Esprit, Tony Wauters, Greet Vanden Berghe:
A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem. Eur. J. Oper. Res. 257(2): 526-538 (2017) - [i1]Fabio Salassa, Wim Vancroonenburg, Tony Wauters, Federico Della Croce, Greet Vanden Berghe:
MILP and Max-Clique based heuristics for the Eternity II puzzle. CoRR abs/1709.00252 (2017) - 2016
- [j12]Tony Wauters, Fulgencia Villa, Jan Christiaens, Ramón Alvarez-Valdés, Greet Vanden Berghe:
A decomposition approach to dual shuttle automated storage and retrieval systems. Comput. Ind. Eng. 101: 325-337 (2016) - [j11]Túlio A. M. Toffolo, Tony Wauters, Sam Van Malderen, Greet Vanden Berghe:
Branch-and-bound with decomposition-based lower bounds for the Traveling Umpire Problem. Eur. J. Oper. Res. 250(3): 737-744 (2016) - [j10]Michele Garraffa, Fabio Salassa, Wim Vancroonenburg, Greet Vanden Berghe, Tony Wauters:
The one-dimensional cutting stock problem with sequence-dependent cut losses. Int. Trans. Oper. Res. 23(1-2): 5-24 (2016) - [j9]Tony Wauters, Joris Kinable, Pieter Smet, Wim Vancroonenburg, Greet Vanden Berghe, Jannes Verstichel:
The Multi-Mode Resource-Constrained Multi-Project Scheduling Problem - The MISTA 2013 challenge. J. Sched. 19(3): 271-283 (2016) - [c3]Janniele A. S. Araujo, Haroldo G. Santos, Davi D. Baltar, Túlio A. M. Toffolo, Tony Wauters:
Neighborhood Composition Strategies in Stochastic Local Search. HM 2016: 118-130 - 2015
- [j8]Tony Wauters, Katja Verbeeck, Patrick De Causmaecker, Greet Vanden Berghe:
A learning-based optimization approach to multi-project scheduling. J. Sched. 18(1): 61-74 (2015) - 2014
- [j7]Joris Kinable, Tony Wauters, Greet Vanden Berghe:
The concrete delivery problem. Comput. Oper. Res. 48: 53-68 (2014) - [j6]Tony Wauters, Sam Van Malderen, Greet Vanden Berghe:
Decomposition and local search based methods for the traveling umpire problem. Eur. J. Oper. Res. 238(3): 886-898 (2014) - 2013
- [j5]Tony Wauters, Jannes Verstichel, Greet Vanden Berghe:
An effective shaking procedure for 2D and 3D strip packing problems. Comput. Oper. Res. 40(11): 2662-2669 (2013) - [j4]Tony Wauters, Wim Vancroonenburg, Greet Vanden Berghe:
A Guide-and-Observe Hyper-Heuristic Approach to the Eternity II Puzzle. J. Math. Model. Algorithms 12(1): 27-43 (2013) - [p1]Tony Wauters, Katja Verbeeck, Patrick De Causmaecker, Greet Vanden Berghe:
Boosting Metaheuristic Search Using Reinforcement Learning. Hybrid Metaheuristics 2013: 433-452 - 2012
- [b1]Tony Wauters:
Reinforcement Learning Enhanced Heuristic Search for CombinatorialOptimizationReinforcement Learning Enhanced Heuristic Search for CombinatorialOptimization (Reinforcement Learning gebaseerde heuristieken voorcombinatorische optimalisatie). Katholieke Universiteit Leuven, Belgium, 2012 - [j3]Tony Wauters, Katja Verbeeck, Paul Verstraete, Greet Vanden Berghe, Patrick De Causmaecker:
Real-world production scheduling for the food industry: An integrated approach. Eng. Appl. Artif. Intell. 25(2): 222-228 (2012) - [j2]Tony Wauters, Wim Vancroonenburg, Greet Vanden Berghe:
A Guide-and-Observe Hyper-Heuristic Approach to the Eternity II Puzzle. J. Math. Model. Algorithms 11(3): 217-233 (2012) - [c2]Tony Wauters, Katja Verbeeck, Patrick De Causmaecker, Greet Vanden Berghe:
Fast Permutation Learning. LION 2012: 292-306 - 2011
- [j1]Tony Wauters, Katja Verbeeck, Greet Vanden Berghe, Patrick De Causmaecker:
Learning agents for the multi-mode project scheduling problem. J. Oper. Res. Soc. 62(2): 281-290 (2011) - 2010
- [c1]Tony Wauters, Katja Verbeeck, Greet Vanden Berghe, Patrick De Causmaecker:
A game theoretic approach to decentralized multi-project scheduling. AAMAS 2010: 1415-1416
Coauthor Index
aka: Túlio Ângelo Machado Toffolo
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 23:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
