| Publication | Date of Publication | Type |
|---|
A disaggregated integer L-shaped method for the bike sharing rebalancing problem with stochastic demands
European Journal of Operational Research | 2026-02-24 | Paper |
Integrated and sequential algorithms for the robust two-echelon location-routing problem under demand uncertainty
Computers & Operations Research | 2025-12-02 | Paper |
A GRASP algorithm for the concrete delivery problem
Computers & Operations Research | 2025-05-26 | Paper |
A disaggregated integer L-shaped method for stochastic vehicle routing problems with monotonic recourse
European Journal of Operational Research | 2025-05-16 | Paper |
| A heuristic column generation approach for the stochastic bin packing problem | 2024-09-17 | Paper |
Multi-period time window assignment for attended home delivery
European Journal of Operational Research | 2024-08-13 | Paper |
A novel reformulation for the single-sink fixed-charge transportation problem
Mathematical Programming. Series A. Series B | 2023-10-23 | Paper |
A Branch-and-Price Algorithm for the Multiple Knapsack Problem
INFORMS Journal on Computing | 2023-01-11 | Paper |
| The disaggregated integer L-shaped method for the stochastic vehicle routing problem | 2022-12-13 | Paper |
Order assignment and scheduling under processing and distribution time uncertainty
European Journal of Operational Research | 2022-10-17 | Paper |
Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
INFORMS Journal on Computing | 2022-06-30 | Paper |
Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
INFORMS Journal on Computing | 2022-06-27 | Paper |
Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
INFORMS Journal on Computing | 2022-06-27 | Paper |
Models and algorithms for the delivery and installation routing problem
European Journal of Operational Research | 2021-06-04 | Paper |
The Meet-in-the-Middle Principle for Cutting and Packing Problems
INFORMS Journal on Computing | 2020-12-03 | Paper |
Exact algorithms for the multi-pickup and delivery problem with time windows
European Journal of Operational Research | 2020-05-07 | Paper |
A Primal Decomposition Algorithm for the Two-dimensional Bin Packing Problem
(available as arXiv preprint) | 2019-09-15 | Paper |
The value of integrating loading and routing
European Journal of Operational Research | 2018-05-24 | Paper |
The multi-pickup and delivery problem with time windows
European Journal of Operational Research | 2018-04-23 | Paper |
An exact algorithm for the two-dimensional orthogonal packing problem with unloading constraints
Operations Research | 2015-09-11 | Paper |
Combinatorial Benders' cuts for the strip packing problem
Operations Research | 2014-12-22 | Paper |
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
Networks | 2013-08-06 | Paper |
Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
Networks | 2012-11-15 | Paper |
Optimized domain decomposition methods for the spherical Laplacian
SIAM Journal on Numerical Analysis | 2011-03-15 | Paper |
A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
European Journal of Operational Research | 2009-06-29 | Paper |
Optimized Schwarz methods with an overset grid for the shallow-water equations: Preliminary results
Applied Numerical Mathematics | 2008-04-07 | Paper |
| scientific article; zbMATH DE number 2143551 (Why is no real title available?) | 2005-03-10 | Paper |
| scientific article; zbMATH DE number 1953311 (Why is no real title available?) | 2003-07-27 | Paper |
| scientific article; zbMATH DE number 1302819 (Why is no real title available?) | 1999-12-05 | Paper |
| scientific article; zbMATH DE number 1004950 (Why is no real title available?) | 1997-05-28 | Paper |
