Scheduling jobs with fixed start and end times
Discrete Applied Mathematics
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Improved Approximation Algorithms for Resource Allocation
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Decomposition and Dynamic Cut Generation in Integer Linear Programming
Mathematical Programming: Series A and B
A quasi-PTAS for unsplittable flow on line graphs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Selected Topics in Column Generation
Operations Research
The Multidimensional Knapsack Problem: Structure and Algorithms
INFORMS Journal on Computing
Resource allocation with time intervals
Theoretical Computer Science
A Freight Service Design Problem for a Railway Corridor
Transportation Science
Partial convexification of general MIPs by Dantzig-Wolfe reformulation
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Experiments with a generic dantzig-wolfe decomposition for integer programs
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
The temporal knapsack problem and its solution
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
| Hi-index | 0.00 |
We study a natural generalization of the knapsack problem, in which each item exists only for a given time interval. One has to select a subset of the items as in the classical case, guaranteeing that for each time instant, the set of existing selected items has total weight no larger than the knapsack capacity. We focus on the exact solution of the problem, noting that prior to our work, the best method was the straightforward application of a general-purpose solver to the natural integer linear programming formulation. Our results indicate that much better results can be obtained by using the same general-purpose solver to tackle a nonstandard Dantzig-Wolfe reformulation in which subproblems are associated with groups of constraints. This is also interesting because the more natural Dantzig-Wolfe reformulation of single constraints performs extremely poorly in practice.