| Publication | Date of Publication | Type |
|---|
Double traversals in optimal picker routes for warehouses with multiple blocks Operations Research Letters | 2026-04-24 | Paper |
Deterministic Structure of Vertical Configurations in Minimal Picker Tours for Rectangular Warehouses (available as arXiv preprint) | 2026-01-01 | Paper |
Double Traversals in Boundary Subaisles: Implications for Two-Block Layouts (available as arXiv preprint) | 2026-01-01 | Paper |
Modified Dynamic Programming Algorithms for Order Picking in Single-Block and Two-Block Rectangular Warehouses (available as arXiv preprint) | 2026-01-01 | Paper |
Deep reinforcement learning for dynamic order picking in warehouse operations Computers & Operations Research | 2025-09-10 | Paper |
Solving hard bi-objective knapsack problems using deep reinforcement learning Discrete Optimization | 2025-07-08 | Paper |
Learning to project in a criterion space search algorithm: an application to multi-objective binary linear programming Optimization Letters | 2025-06-23 | Paper |
Double Traversals in Optimal Picker Routes for Warehouses with Multiple Blocks (available as arXiv preprint) | 2025-01-01 | Paper |
A Modified Algorithm for Optimal Picker Routing in a Single Block Warehouse (available as arXiv preprint) | 2024-01-01 | Paper |
| Large Markov Decision Processes and Combinatorial Optimization | 2022-12-24 | Paper |
scientific article; zbMATH DE number 7625175 (Why is no real title available?) (available as arXiv preprint) | 2022-11-29 | Paper |
| scientific article; zbMATH DE number 7625175 (Why is no real title available?) | 2022-11-29 | Paper |
Large Markov Decision Processes and Combinatorial Optimization (available as arXiv preprint) | 2022-01-01 | Paper |
| Surprise Maximization: A Dynamic Programming Approach | 2020-12-29 | Paper |
Hamiltonian cycles and subsets of discounted occupational measures Mathematics of Operations Research | 2020-09-01 | Paper |
Surprise Maximization: A Dynamic Programming Approach (available as arXiv preprint) | 2020-01-01 | Paper |
An analytical bound on the fleet size in vehicle routing problems: a dynamic programming approach (available as arXiv preprint) | 2019-05-14 | Paper |
A new approach to select the best subset of predictors in linear regression modelling: bi-objective mixed integer linear programming The ANZIAM Journal | 2019-03-20 | Paper |
Planning of complex supply chains: a performance comparison of three meta-heuristic algorithms Computers & Operations Research | 2018-07-11 | Paper |
Fisher information for a partially observable simple birth process Communications in Statistics. Theory and Methods | 2016-11-23 | Paper |
On transition matrices of Markov chains corresponding to Hamiltonian cycles Annals of Operations Research | 2016-11-07 | Paper |
On Binomial Observations of Continuous-Time Markovian Population Models Journal of Applied Probability | 2015-10-02 | Paper |
Hamiltonian cycles, random walks, and discounted occupational measures Mathematics of Operations Research | 2012-05-24 | Paper |
A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem Annals of Operations Research | 2012-03-08 | Paper |