| Publication | Date of Publication | Type |
|---|
| An optimal algorithm for variable knockout problems | 2024-12-20 | Paper |
| An optimisation model for minimising changes in frequency allocations | 2023-07-12 | Paper |
| A heuristic for the non-unicost set covering problem using local branching | 2022-07-07 | Paper |
| A discrete optimisation approach for target path planning whilst evading sensors | 2022-03-09 | Paper |
| A two stage approach for order and rack allocation with order backlog in a mobile rack environment | 2021-10-21 | Paper |
| A discrete optimisation approach for target path planning whilst evading sensors | 2021-06-16 | Paper |
| Quantitative portfolio selection: using density forecasting to find consistent portfolios | 2021-06-03 | Paper |
| Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment | 2021-04-20 | Paper |
| Order batching using an approximation for the distance travelled by pickers | 2020-05-07 | Paper |
| Packing a fixed number of identical circles in a circular container with circular prohibited areas | 2019-10-18 | Paper |
| An algorithm for the optimal solution of variable knockout problems | 2019-08-06 | Paper |
| Packing unequal rectangles and squares in a fixed size circular container using formulation space search | 2018-07-11 | Paper |
| Optimally solving the joint order batching and picker routing problem | 2017-12-06 | Paper |
| Packing unequal circles using formulation space search | 2017-01-05 | Paper |
| Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories | 2016-11-30 | Paper |
| A formulation space search heuristic for packing unequal circles in a fixed size circular container | 2016-10-07 | Paper |
| Factor neutral portfolios | 2015-10-19 | Paper |
| An optimisation approach to constructing an exchange-traded fund | 2015-04-23 | Paper |
| Market neutral portfolios | 2014-11-28 | Paper |
| A note on solving MINLP's using formulation space search | 2014-04-30 | Paper |
| Index tracking with fixed and variable transaction costs | 2014-03-14 | Paper |
| Metaheuristics with disposal facility positioning for the waste collection VRP with time windows | 2013-11-01 | Paper |
| A heuristic for the circle packing problem with a variety of containers | 2011-08-19 | Paper |
| Improving Benders decomposition using a genetic algorithm | 2009-12-07 | Paper |
| Path finding approaches and metabolic pathways | 2009-06-24 | Paper |
| Mixed-integer programming approaches for index tracking and enhanced indexation | 2009-01-08 | Paper |
| A tabu search algorithm for the single vehicle routing allocation problem | 2008-07-21 | Paper |
| Scatter search and bionomic algorithms for the aircraft landing problem | 2006-03-16 | Paper |
| Displacement problem and dynamically scheduling aircraft landings | 2005-04-04 | Paper |
| Scheduling aircraft landings at London Heathrow using a population heuristic | 2005-03-16 | Paper |
| Placing boxes on shelves: a case study | 2005-03-16 | Paper |
| Improving short-term conflict alert via tabu search | 2005-03-14 | Paper |
| A population heuristic for constrained two-dimensional non-guillotine cutting | 2004-08-19 | Paper |
| Allocating fixed costs and resources via data envelopment analysis | 2003-04-10 | Paper |
| Scheduling Aircraft Landings—The Static Case | 2002-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4355916 | 2000-04-25 | Paper |
| Vehicle routing with a sparse feasibility graph | 1999-02-22 | Paper |
| A branch and cut algorithm for the Steiner problem in graphs | 1998-03-05 | Paper |
| The vehicle routing-allocation problem: A unifying framework | 1997-02-23 | Paper |
| Obtaining test problems via Internet | 1996-07-23 | Paper |
| Determining Teaching and Research Efficiencies | 1995-08-01 | Paper |
| A delaunay triangulation‐based heuristic for the euclidean steiner problem | 1995-03-08 | Paper |
| Locating Benefit Posts in Brazil | 1994-04-12 | Paper |
| Lagrangean heuristics for location problems | 1993-06-29 | Paper |
| A heuristic for Euclidean and rectilinear Steiner problems | 1992-10-06 | Paper |
| Enhancing an algorithm for set covering problems | 1992-10-06 | Paper |
| Linear Programming on Cray Supercomputers | 1990-01-01 | Paper |
| Restricting Weight Flexibility in Data Envelopment Analysis | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4735035 | 1990-01-01 | Paper |
| An SST-based algorithm for the steiner problem in graphs | 1989-01-01 | Paper |
| An algorithm for the resource constrained shortest path problem | 1989-01-01 | Paper |
| An algorithm for solving large capacitated warehouse location problems | 1988-01-01 | Paper |
| An algorithm for set covering problem | 1987-01-01 | Paper |
| An algorithm for the two-dimensional assortment problem | 1985-01-01 | Paper |
| A note on solving large p-median problems | 1985-01-01 | Paper |
| Bounds for Two-Dimensional Cutting | 1985-01-01 | Paper |
| An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure | 1985-01-01 | Paper |
| Algorithms for Unconstrained Two-Dimensional Guillotine Cutting | 1985-01-01 | Paper |
| Fixed Routes | 1984-01-01 | Paper |
| The period routing problem | 1984-01-01 | Paper |
| An algorithm for the steiner problem in graphs | 1984-01-01 | Paper |
| Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem | 1983-01-01 | Paper |
| Vehicle Fleet Composition | 1983-01-01 | Paper |
| A tree search algorithm for the p-median problem | 1982-01-01 | Paper |
