< Back to previous page
Researcher
Tony Wauters
- Disciplines:Operations research and mathematical programming
Affiliations
- Numerical Analysis and Applied Mathematics (NUMA) (Division)
Member
From1 Aug 2020 → Today - Computer Science Technology, Ghent and Aalst Technology Campuses (Technology cluster)
Member
From1 Oct 2013 → 31 Jul 2020 - Computer Science, Kulak Kortrijk Campus (Department)
Member
From1 Jan 2010 → 30 Sep 2013
Projects
1 - 10 of 19
- Optimisation algorithms for 3D irregular cutting and packing problemsFrom16 Jan 2024 → 28 Feb 2024Funding: Own budget, for example: patrimony, inscription fees, gifts
- C3PO: Optimisation algorithms for 3D irregular cutting & packing problems with real-world constraintsFrom1 Oct 2023 → TodayFunding: IOF - technology concept exploration
- Ultrasonic/Very-High-Cycle Fatigue MachineFrom1 Jan 2023 → TodayFunding: BOF - scientific equipment program
- Numerical Simulation of Fatigue Fracture in Micro-Sized Electron Beam Melted PartsFrom31 Mar 2021 → TodayFunding: Own budget, for example: patrimony, inscription fees, gifts
- Trustworthy and insightful algorithms for industrial decision makingFrom15 Mar 2021 → TodayFunding: Own budget, for example: patrimony, inscription fees, gifts
- Trustworthy and insightful algorithms for industrial decision making.From1 Jan 2021 → TodayFunding: BOF - doctoral mandates
- Combinatorial bounds for heuristic neighbourhood searchFrom1 Jan 2021 → 31 Dec 2022Funding: Fund Recuperation Fiscal Exemption
- Parallel algorithms for 3D irregular cutting and packing problemsFrom3 Sep 2020 → TodayFunding: Own budget, for example: patrimony, inscription fees, gifts
- Monte Carlo Tree Search and Instance Space Analysis for the 0-1 Knapsack ProblemFrom23 Oct 2019 → 12 Jun 2023Funding: Own budget, for example: patrimony, inscription fees, gifts
- Algorithms to solve 2D and 3D Irregular Cutting and Packing Problems using a Semi-discrete RepresentationFrom17 Oct 2018 → 26 Jan 2024Funding: Own budget, for example: patrimony, inscription fees, gifts
Publications
1 - 10 of 48
- Algorithms to solve 2D and 3D Irregular Cutting and Packing Problems using a Semi-discrete Representation(2024)
Authors: Sahar Chehrazad, Dirk Roose, Tony Wauters
- The exam location problem: mathematical formulations and variants(2024)
Authors: Hatice Çalik, Tony Wauters, Greet Vanden Berghe
- Monte Carlo Tree Search and Instance Space Analysis for the 0-1 Knapsack Problem(2023)
Authors: Jorik Jooken, Patrick De Causmaecker, Jan Goedgebeur, Pieter Leyman, Tony Wauters
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems(2023)
Authors: Jorik Jooken, Pieter Leyman, Tony Wauters, Patrick De Causmaecker
- A Goal-Driven Ruin and Recreate Heuristic for the 2D Variable-Sized Bin Packing Problem with Guillotine Constraints(2022)
Authors: Jeroen Gardeyn, Tony Wauters
Pages: 432 - 444 - A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation(2022)
Authors: Sahar Chehrazad, Dirk Roose, Tony Wauters
Pages: 809 - 826 - Integrated Yard Management Optimisation(2022)
Authors: Emmanouil Thanos, Greet Vanden Berghe, Tony Wauters
- The impact of loading restrictions on the two-echelon location routing problem(2021)
Authors: Vinícius Gandra Martins Santos, Hatice Çalik, Tony Wauters, Greet Vanden Berghe
- Extracting maximal objects from three-dimensional solid materials(2021)
Authors: Hatice Çalik, Wim Vancroonenburg, Tony Wauters
- A heuristic approach to feasibility verification for truck loading(2021)
Authors: Vinícius Gandra Martins Santos, Hatice Çalik, Tony Wauters, Greet Vanden Berghe
Pages: 1564 - 1569Number of pages: 6
Linked dataset
1 - 1 of 1
- Instances for the Exam Location Problem (Creator)