| Publication | Date of Publication | Type |
|---|
A flow-based formulation for parallel machine scheduling using decision diagrams
INFORMS Journal on Computing | 2025-01-28 | Paper |
An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem
European Journal of Operational Research | 2024-08-13 | Paper |
Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences
Computers & Operations Research | 2024-06-25 | Paper |
The mobile production vehicle routing problem: using 3D printing in last mile distribution
European Journal of Operational Research | 2022-12-12 | Paper |
Consistency cuts for Dantzig-Wolfe reformulations
Operations Research | 2022-12-01 | Paper |
The Mobile Production Vehicle Routing Problem: Using 3D Printing in Last Mile Distribution
(available as arXiv preprint) | 2022-02-25 | Paper |
A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing
European Journal of Operational Research | 2021-11-09 | Paper |
Simultaneously exploiting two formulations: an exact Benders decomposition approach
Computers & Operations Research | 2021-04-20 | Paper |
| The multi-port berth allocation problem with speed optimization: Exact methods and a cooperative game analysis | 2020-11-30 | Paper |
A branch-and-price approach to the feeder network design problem
European Journal of Operational Research | 2017-11-23 | Paper |
An adaptive large neighborhood search heuristic for the electric vehicle scheduling problem
Computers & Operations Research | 2016-11-17 | Paper |
The electric fleet size and mix vehicle routing problem with time windows and recharging stations
European Journal of Operational Research | 2016-10-07 | Paper |
A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
European Journal of Operational Research | 2015-02-19 | Paper |
A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
European Journal of Operational Research | 2015-02-03 | Paper |
Modeling and solving a multimodal transportation problem with flexible-time and scheduled services
Networks | 2011-02-17 | Paper |
Scheduling technicians and tasks in a telecommunications company
Journal of Scheduling | 2010-10-08 | Paper |
Recent models and algorithms for one-to-one pickup and delivery problems
Operations Research/Computer Science Interfaces | 2010-06-02 | Paper |
The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
Mathematical Programming. Series A. Series B | 2010-02-19 | Paper |
Horizontal cooperation among freight carriers: request allocation and profit sharing
The Journal of the Operational Research Society | 2009-08-28 | Paper |
Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
Networks | 2007-07-30 | Paper |
A general heuristic for vehicle routing problems
Computers & Operations Research | 2007-02-26 | Paper |
A unified heuristic for a large class of vehicle routing problems with backhauls
European Journal of Operational Research | 2006-03-22 | Paper |
