Abstract
This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack problem is a generalisation of the knapsack problem and specialisation of the multidimensional (or multiconstraint) knapsack problem. It arises naturally in applications such as allocating communication bandwidth or CPUs in a multiprocessor to bids for the resources. The algorithms considered use and combine techniques from constraint programming, artificial intelligence and operations research.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
- Problem Instance
- Knapsack Problem
- Decomposition Algorithm
- Linear Relaxation
- Multidimensional Knapsack Problem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Foster, I., Kesselman, C., Tuecke, S.: The anatomy of the Grid: Enabling scalable virtual organization. The International Journal of High Performance Computing Applications 15, 200–222 (2001)
Roy, A., Sander, V.: Advanced reservation API. GFD-E5, Scheduling Working Group, Global Grid Forum, GGF (2003)
Foster, I., Kesselman, C., Nick, J., Tuecke, S.: The physiology of the grid: An open grid services architecture for distributed systems integration (2002)
Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990)
Fréville, A.: The multidimensional 0-1 knapsack problem: An overview. European Journal of Operational Research 155, 1–21 (2004)
Walsh, T.: Stochastic constraint programming. In: Proc. of the Fifteenth European Conf. on Artificial Intelligence, pp. 1–5. IOS Press, Amsterdam (2002)
Marinescu, R., Dechter, R.: AND/OR tree search for constraint optimization. In: Proc. of the 6th International Workshop on Preferences and Soft Constraints (2004)
Manna, Z.: The correctness of nondeterministic programs. Artificial Intelligence 1, 1–26 (1970)
Nilsson, N.J.: Principles of Artificial Intelligence. Tioga (1980)
Martelli, A., Montanari, U.: Additive AND/OR graphs. In: Proc. of the Fourth Int. Joint Conf. on Artificial Intelligence, pp. 345–350 (1975)
Chang, C.L., Slagle, J.: An admissible and optimal algorithm for searching AND/OR graphs. Artificial Intelligence 2, 117–128 (1971)
Chvatal, V.: Linear Programming. W.H. Freeman, New York (1983)
Bixby, R.E., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: MIP: Theory and practice — closing the gap. In: Powell, M.J.D., Scholtes, S. (eds.) System Modelling and Optimization: Methods, Theory, and Applications, pp. 19–49. Kluwer Academic Publishers, Dordrecht (2000)
Wolsey, L.A.: Integer Programming. John Wiley and Sons, New York (1998)
Oliva, C., Michelon, P., Artigues, C.: Constraint and linear programming: Using reduced costs for solving the zero/one multiple knapsack problem. In: Proc. of the Workshop on Cooperative Solvers in Constraint Programming (CoSolv 2001), Paphos, Cyprus, pp. 87–98 (2001)
Russell, S.J.: Efficient memory-bounded search methods. In: Proc. of the Tenth European Conf. on Artificial Intelligence, Vienna, pp. 1–5. Wiley, Chichester (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bartlett, M., Frisch, A.M., Hamadi, Y., Miguel, I., Tarim, S.A., Unsworth, C. (2005). The Temporal Knapsack Problem and Its Solution. In: Barták, R., Milano, M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2005. Lecture Notes in Computer Science, vol 3524. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11493853_5
Download citation
DOI: https://doi.org/10.1007/11493853_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26152-0
Online ISBN: 978-3-540-32264-1
eBook Packages: Computer ScienceComputer Science (R0)