| Publication | Date of Publication | Type |
|---|
Last‐mile delivery with drone and lockers
Networks | 2024-03-15 | Paper |
Matheuristics: survey and synthesis
International Transactions in Operational Research | 2023-10-04 | Paper |
Matheuristics. Algorithms and implementations
EURO Advanced Tutorials on Operational Research | 2021-11-15 | Paper |
Client-side computational optimization
ACM Transactions on Mathematical Software | 2019-10-18 | Paper |
Route relaxations on GPU for vehicle routing problems
European Journal of Operational Research | 2018-05-25 | Paper |
A Lagrangian heuristic for sprint planning in agile software development
Computers & Operations Research | 2016-11-10 | Paper |
Using GPU computing for solving the two-dimensional guillotine cutting problem
INFORMS Journal on Computing | 2016-11-01 | Paper |
A set covering based matheuristic for a real-world city logistics problem
International Transactions in Operational Research | 2015-04-22 | Paper |
Algorithms for nesting with defects
Discrete Applied Mathematics | 2014-09-08 | Paper |
A fully distributed Lagrangean solution for a peer-to-peer overlay network design problem
INFORMS Journal on Computing | 2012-07-28 | Paper |
An exact algorithm for the two-dimensional strip-packing problem
Operations Research | 2011-11-17 | Paper |
Exact methods for large-scale multi-period financial planning problems
Computational Management Science | 2009-09-03 | Paper |
Benders decomposition, Lagrangean relaxation and metaheuristic design
Journal of Heuristics | 2009-08-06 | Paper |
A dual ascent procedure for the set partitioning problem
Discrete Optimization | 2008-11-19 | Paper |
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
European Journal of Operational Research | 2007-08-27 | Paper |
| scientific article; zbMATH DE number 2209648 (Why is no real title available?) | 2005-09-28 | Paper |
| scientific article; zbMATH DE number 2163587 (Why is no real title available?) | 2005-04-29 | Paper |
An exact algorithm for the simplified multiple depot crew scheduling problem
Annals of Operations Research | 2004-11-22 | Paper |
New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
IMA Journal of Management Mathematics | 2004-09-07 | Paper |
New lower bounds for the three-dimensional finite bin packing problem
Discrete Applied Mathematics | 2004-08-06 | Paper |
The two-dimensional finite bin packing problem. II: New lower and upper bounds
4OR | 2004-06-11 | Paper |
The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
4OR | 2004-05-18 | Paper |
A Set Partitioning Approach to the Crew Scheduling Problem
Operations Research | 2002-11-05 | Paper |
| A Comparison of Three Basic Conjugate Direction Methods | 1998-11-23 | Paper |
