| Publication | Date of Publication | Type |
|---|
Models for two-dimensional bin packing problems with customer order spread
Journal of Combinatorial Optimization | 2024-10-21 | Paper |
Mathematical models for the minimization of open stacks problem
International Transactions in Operational Research | 2023-11-29 | Paper |
Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost
Journal of Combinatorial Optimization | 2022-08-26 | Paper |
The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics
Computational and Applied Mathematics | 2019-10-14 | Paper |
Scheduling identical parallel machines with tooling constraints
European Journal of Operational Research | 2018-05-24 | Paper |
A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
Annals of Operations Research | 2017-12-15 | Paper |
Optimization models for the three-dimensional container loading problem with practical constraints
Springer Optimization and Its Applications | 2017-06-29 | Paper |
The one-dimensional cutting stock problem with usable leftovers -- a survey
European Journal of Operational Research | 2015-07-29 | Paper |
The usable leftover one-dimensional cutting stock problem -- a priority-in-use heuristic
International Transactions in Operational Research | 2013-05-23 | Paper |
Connections between cutting-pattern sequencing, VLSI design, and flexible machines
Computers & Operations Research | 2013-03-25 | Paper |
Observations on optimal parallelizations of two-list algorithm
Parallel Computing | 2010-09-02 | Paper |
An algorithm for determining the \(k\)-best solutions of the one-dimensional knapsack problem
Pesquisa Operacional | 2010-03-06 | Paper |
The minimization of open stacks problem: a review of some properties and their use in pre-processing operations
European Journal of Operational Research | 2009-12-21 | Paper |
The one-dimensional cutting stock problem with usable leftover - a heuristic approach
European Journal of Operational Research | 2009-12-07 | Paper |
A note on linear models for two-group and three-group two-dimensional guillotine cutting problems
International Journal of Production Research | 2009-02-24 | Paper |
Parallel time and space upper-bounds for the subset-sum problem
Theoretical Computer Science | 2008-11-18 | Paper |
An enumeration scheme to generate constrained exact checkerboard patterns
Computers & Operations Research | 2007-11-30 | Paper |
An integrated cutting stock and sequencing problem
European Journal of Operational Research | 2007-08-27 | Paper |
An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
European Journal of Operational Research | 2006-11-15 | Paper |
Linear models for 1-group two-dimensional guillotine cutting problems
International Journal of Production Research | 2006-08-28 | Paper |
A hybrid heuristic to reduce the number of different patterns in cutting stock problems
Computers & Operations Research | 2006-05-16 | Paper |
Checkerboard pattern: proposals for its generation
International Transactions in Operational Research | 2005-04-15 | Paper |
Refinements on an enumeration scheme for solving a pattern sequencing problem
International Transactions in Operational Research | 2005-01-31 | Paper |
A method for solving the minimization of the maximum number of open stacks problem within a cutting process
Computers & Operations Research | 2004-11-18 | Paper |
Comments on parallel algorithms for the knapsack problem.
Parallel Computing | 2003-01-21 | Paper |
On a pattern sequencing problem to minimize the maximum number of open stacks
European Journal of Operational Research | 1999-02-22 | Paper |
A polynomial approximation scheme for the subset sum problem
Discrete Applied Mathematics | 1995-04-10 | Paper |
A search strategy for the one-size assortment problem
European Journal of Operational Research | 1994-07-21 | Paper |
Two-dimensional Cutting Stock with Multiple Stock Sizes
The Journal of the Operational Research Society | 1991-01-01 | Paper |
EOQ Systems: The Case of an Increase in Purchase Cost
The Journal of the Operational Research Society | 1990-01-01 | Paper |
A new enumeration scheme for the knapsack problem
Discrete Applied Mathematics | 1987-01-01 | Paper |
Deterministic Approximations to Stochastic Production Problems
Operations Research | 1984-01-01 | Paper |
Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
Management Science | 1984-01-01 | Paper |
Computational Complexity of the Capacitated Lot Size Problem
Management Science | 1982-01-01 | Paper |
