publicações selecionadas
-
artigo académico
- A combinatorial flow-based formulation for temporal bin packing problems. European Journal of Operational Research. 2023
- Arc flow formulations based on dynamic programming: Theoretical foundations and applications. European Journal of Operational Research. 2022
- Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups. Optimization Letters. 2022
- Preface to the Special Issue on Cutting and Packing. Energy Policy. 2016
- A Branch-and-Price Algorithm for the Vehicle Routing Problem with 2-Dimensional Loading Constraints. Computational Methods in Applied Sciences. 2015
- GRAPH PROPERTIES OF MINIMIZATION OF OPEN STACKS PROBLEMS AND A NEW INTEGER PROGRAMMING MODEL. Pesquisa Operacional. 2015
- SOLVING TWO-DIMENSIONAL BIN PACKING PROBLEMS WITH TWO-STAGE GUILLOTINE CUTTING BY COMBINED LOCAL SEARCH HEURISTICS. Pacific Journal of Optimization. 2013
- Special issue on "Cutting and Packing". Energy Policy. 2013
- A column generation approach for the bi-objective max-min knapsack problem. ICORES 2012 - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems. 2012
- Computing valid inequalities for general integer programs using an extension of maximal dual feasible functions to negative arguments. ICORES 2012 - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems. 2012
- Generalized disaggregation algorithm for the vehicle routing problem with time windows and multiple routes. ICORES 2012 - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems. 2012
- Efficient lower bounding procedures with application in the allocation of virtual machines to data centers. WSEAS Transactions on Circuits and Systems. 2011
- General properties of staircase and convex dual feasible functions. WSEAS Transactions on Circuits and Systems. 2011
- A Fast Heuristic for a Lot Splitting and Scheduling Problem of a Textile Industry. IFAC proceedings volumes. 2010
- A survey of dual-feasible and superadditive functions. Annals of Operations Research. 2010
- An integer programming model for the minimum interval graph completion problem. Electronic Notes in Discrete Mathematics. 2010
- Arc-flow model for the two-dimensional guillotine cutting stock problem. Computers & Operations Research. 2010
- Minimization of open orders using interval graphs. IAENG International Journal of Applied Mathematics. 2010
- Theoretical investigations on maximal dual feasible functions. Operations Research Letters. 2010
- Using interval graphs in an order processing optimization problem. WCE 2010 - World Congress on Engineering 2010. 2010
- New lower bounds based on column generation and constraint programming for the pattern minimization problem. Computers & Operations Research. 2009
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem. Computers & Operations Research. 2008
- New integer programming formulations and an exact algorithm for the ordered cutting stock problem. Journal of the Operational Research SocIETy. 2008
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times. European Journal of Operational Research. 2007
- Accelerating column generation for variable sized bin-packing problems. European Journal of Operational Research. 2007
- Algoritmos de partição e geração de colunas para dimensionamento de lotes de produção 2006
- Dual-optimal inequalities for stabilized column generation. Operations Research. 2006
- Using extra dual cuts to accelerate column generation. Informs Journal on Computing. 2005
- Planeamento de Rotas num Sistema de Recolha de Desperdícios de Madeira 2004
- Programação de operações em sistemas com tempo de processamento variável. Pesquisa Operacional. 2004
- A note on branch-and-price algorithms for the one-dimensional cutting stock problems. Computational Optimization and Applications. 2002
- LP models for bin packing and cutting stock problems. European Journal of Operational Research. 2002
- Exact solution of bin-packing problems using column generation and branch-and-bound. Annals of Operations Research. 1999
- AN LP-BASED APPROACH TO A 2-STAGE CUTTING STOCK PROBLEM. European Journal of Operational Research. 1995
- An LP-based approach to a two-stage cutting stock problem. European Journal of Operational Research. 1995
- A COMPUTER-BASED INTERACTIVE APPROACH TO A 2-STAGE CUTTING STOCK PROBLEM. Infor. 1994
- EVALUATION OF THE EXTENDED CONTROL AND SIMULATION LANGUAGE FOR PERFORMANCE STUDIES OF COMPUTER COMMUNICATION PROTOCOLS. 1985
-
artigo de conferência
-
artigo de revista
- A Matheuristic Approach to the Integration of Three-Dimensional Bin Packing Problem and Vehicle Routing Problem with Simultaneous Delivery and Pickup. Biology. 2023
- An arc flow formulation to the multitrip production, inventory, distribution, and routing problem with time windows. Energy Policy. 2022
- A strong integer linear optimization model to the compartmentalized knapsack problem. Energy Policy. 2019
- Variable neighborhood search algorithms for the vehicle routing problem with two-dimensional loading constraints and mixed linehauls and backhauls. Energy Policy. 2018
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems. European Journal of Operational Research. 2018
- Column Generation Based Approaches for Combined Routing and Scheduling. Electronic Notes in Discrete Mathematics. 2018
- Column generation based primal heuristics for routing and loading problems. Electronic Notes in Discrete Mathematics. 2018
- Variable neighborhood search algorithms for pickup and delivery problems with loading constraints. Electronic Notes in Discrete Mathematics. 2017
- An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling. Computers & Operations Research. 2016
- Combined cutting stock and scheduling: A matheuristic approach. International Journal of Innovative Computing and Applications. 2016
- Heuristic methods for the leather nesting problem in the automotive industry. International Journal of Business Excellence. 2016
- Constructing general dual-feasible functions. Operations Research Letters. 2015
- An insertion heuristic for the capacitated vehicle routing problem with loading constraints and mixed linehauls and backhauls. FME Transactions. 2015
- Skewed general variable neighborhood search for the location routing scheduling problem. Computers & Operations Research. 2015
- Solving the Multiscenario Max-Min Knapsack Problem Exactly with Column Generation and Branch-and-Bound. Mathematical Problems in Engineering. 2015
- Integrating two-dimensional cutting stock and lot-sizing problems. Journal of the Operational Research SocIETy. 2014
- Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem. European Journal of Operational Research. 2014
- A hybrid heuristic for the multiple choice multidimensional knapsack problem. Engineering Optimization. 2013
- New constructive algorithms for leather nesting in the automotive industry. Computers & Operations Research. 2012
- A Variable Neighborhood Search Algorithm for the Leather Nesting Problem. Mathematical Problems in Engineering. 2012
- An Exact Algorithm for Bilevel 0-1 Knapsack Problems. Mathematical Problems in Engineering. 2012
- On the extremality of maximal dual feasible functions. Operations Research Letters. 2012
- Worst-case analysis of maximal dual feasible functions. Optimization Letters. 2012
- Exact and heuristic approaches for lot splitting and scheduling on identical parallel machines. International Journal of Manufacturing Technology and Management. 2011
- HEURISTICS WITH STOCHASTIC NEIGHBORHOOD STRUCTURES FOR TWO-DIMENSIONAL BIN PACKING AND CUTTING STOCK PROBLEMS. Asia-Pacific Journal of Operational Research. 2011
- New Stabilization Procedures for the Cutting Stock Problem. Informs Journal on Computing. 2011
- Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. European Journal of Operational Research. 2011
- An integer programming model for two- and three-stage two-dimensional cutting stock problems. European Journal of Operational Research. 2010
- Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem. Optimization Methods & Software. 2010
- Sequence based heuristics for two-dimensional bin packing problems. Engineering Optimization. 2009
- A branch-and-price-and-cut algorithm for the pattern minimization problem. RAIRO - Operations Research. 2008
- An extended model and a column generation algorithm for the planar multicommodity flow problem. Networks. 2007
-
capítulo de livro
- Models and Advanced Optimization Algorithms for the Integrated Management of Logistics Operations. Springer Proceedings in Mathematics & Statistics. 2018
- Heuristics for two-dimensional bin-packing problems 2016
- A Column Generation Approach to the Discrete Lot Sizing and Scheduling Problem on Parallel Machines 2015
- Cutting stock problems 2005
-
documento
-
livro
- Dual-Feasible Functions for Integer Programming and Combinatorial Optimization Basics, Extensions and Applications 2016
- Exact solution of combined cutting stock and scheduling problems 2016
- Integer programming based approaches for multi-trip location routing 2016
- A model-based heuristic for the combined cutting stock and scheduling problem 2015
- Fast Heuristics for Integrated Planning and Scheduling 2015
- A Hybrid Heuristic Based on Column Generation for Two- and Three- Stage Bin Packing Problems 2014
- On the Properties of General Dual-Feasible Functions 2014