| Publication | Date of Publication | Type |
|---|
An arc flow formulation to the multitrip production, inventory, distribution, and routing problem with time windows International Transactions in Operational Research | 2023-11-23 | Paper |
Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls International Transactions in Operational Research | 2023-11-16 | Paper |
Arc flow formulations based on dynamic programming: theoretical foundations and applications European Journal of Operational Research | 2021-11-05 | Paper |
Constructing general dual-feasible functions Operations Research Letters | 2018-09-28 | Paper |
Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound Mathematical Problems in Engineering | 2018-08-27 | Paper |
Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints European Journal of Operational Research | 2018-05-25 | Paper |
| Column generation based approaches for combined routing and scheduling | 2018-04-11 | Paper |
| Column generation based primal heuristics for routing and loading problems | 2018-04-11 | Paper |
| Variable neighborhood search algorithms for pickup and delivery problems with loading constraints | 2018-01-04 | Paper |
| A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints | 2017-11-22 | Paper |
An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling Computers & Operations Research | 2016-11-17 | Paper |
Skewed general variable neighborhood search for the location routing scheduling problem Computers & Operations Research | 2016-11-10 | Paper |
Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem European Journal of Operational Research | 2016-06-24 | Paper |
Dual-feasible functions for integer programming and combinatorial optimization. Basics, extensions and applications EURO Advanced Tutorials on Operational Research | 2016-02-10 | Paper |
An exact algorithm for bilevel 0-1 knapsack problems Mathematical Problems in Engineering | 2013-06-11 | Paper |
A variable neighborhood search algorithm for the leather nesting problem Mathematical Problems in Engineering | 2013-06-11 | Paper |
Worst-case analysis of maximal dual feasible functions Optimization Letters | 2012-12-28 | Paper |
New stabilization procedures for the cutting stock problem INFORMS Journal on Computing | 2012-07-28 | Paper |
On the extremality of maximal dual feasible functions Operations Research Letters | 2012-07-06 | Paper |
Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model European Journal of Operational Research | 2011-08-19 | Paper |
A survey of dual-feasible and superadditive functions Annals of Operations Research | 2010-12-13 | Paper |
A branch-and-price-and-cut algorithm for the pattern minimization problem RAIRO - Operations Research | 2010-10-26 | Paper |
A branch-and-price-and-cut algorithm for the pattern minimization problem RAIRO - Operations Research | 2010-10-26 | Paper |
Theoretical investigations on maximal dual feasible functions Operations Research Letters | 2010-06-08 | Paper |
Arc-flow model for the two-dimensional guillotine cutting stock problem Computers & Operations Research | 2010-01-15 | Paper |
New integer programming formulations and an exact algorithm for the ordered cutting stock problem The Journal of the Operational Research Society | 2009-08-28 | Paper |
New lower bounds based on column generation and constraint programming for the pattern minimization problem Computers & Operations Research | 2009-06-18 | Paper |
A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem Computers & Operations Research | 2008-09-01 | Paper |
Accelerating column generation for variable sized bin-packing problems European Journal of Operational Research | 2007-08-27 | Paper |