Stochastic on-line knapsack problems
Mathematical Programming: Series A and B
The dynamic and stochastic knapsack problem with deadlines
Management Science
Online computation and competitive analysis
Online computation and competitive analysis
A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
A New Fully Polynomial Approximation Scheme for the Knapsack Problem
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
The Dynamic and Stochastic Knapsack Problem
Operations Research
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
INFORMS Journal on Computing
Finite Horizon Stochastic Knapsacks with Applications to Yield Management
Operations Research
The Dynamic and Stochastic Knapsack Problem with Random Sized Items
Operations Research
An Exact Approach to the Strip-Packing Problem
INFORMS Journal on Computing
Heuristic approaches for the two- and three-dimensional knapsack packing problem
Computers and Operations Research
Mixed pallet stacking: an overview and summary of the 2010 PerMIS special session
Proceedings of the 10th Performance Metrics for Intelligent Systems Workshop
| Hi-index | 0.00 |
Planning is an essential part of any logistics system. The paper tries to generalize the view of a logistics planner by framing it as a knapsack problem. We show how the various variants of the knapsack problem compare for different types of industries. We also introduce the pallet stacking problem and survey some of the recent advances made towards this problem.