| 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 |
A strong integer linear optimization model to the compartmentalized knapsack problem
International Transactions in Operational Research | 2023-11-16 | Paper |
A combinatorial flow-based formulation for temporal bin packing problems
European Journal of Operational Research | 2023-07-04 | Paper |
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
Optimization Letters | 2022-10-11 | 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 |
A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
European Journal of Operational Research | 2018-05-30 | 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 |
Solving two-dimensional bin packing problems with two-stage guillotine cutting by combined local search heuristics
Pacific Journal of Optimization | 2013-09-04 | 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 |
Using extra dual cuts to accelerate column generation
INFORMS Journal on Computing | 2012-06-08 | Paper |
An integer programming model for the minimum interval graph completion problem
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
| Minimization of open orders using interval graphs | 2011-12-24 | 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 |
An integer programming model for two- and three-stage two-dimensional cutting stock problems
European Journal of Operational Research | 2010-06-11 | Paper |
Theoretical investigations on maximal dual feasible functions
Operations Research Letters | 2010-06-08 | Paper |
Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
Optimization Methods & Software | 2010-05-21 | 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 |
Dual-Optimal Inequalities for Stabilized Column Generation
Operations Research | 2009-08-13 | 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 |
An extended model and a column generation algorithm for the planar multicommodity flow problem
Networks | 2007-07-20 | Paper |
A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
European Journal of Operational Research | 2006-11-15 | Paper |
Cutting Stock Problems
Column Generation | 2006-10-16 | Paper |
A note on ``Branch-and-price algorithms for the one-dimensional cutting stock problems
Computational Optimization and Applications | 2003-08-26 | Paper |
LP models for bin packing and cutting stock problems
European Journal of Operational Research | 2002-11-17 | Paper |
Exact solution of bin-packing problems using column generation and branch-and-bound
Annals of Operations Research | 1999-06-10 | Paper |
Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
International Transactions in Operational Research | 1999-05-05 | Paper |
An LP-based approach to a two-stage cutting stock problem
European Journal of Operational Research | 1998-11-05 | Paper |
A Computer Based Interactive Approach To A Two-Stage Cutting Stock Problem
INFOR: Information Systems and Operational Research | 1995-05-23 | Paper |
