The temporal knapsack problem and its solution

Lecture Notes in Computer Science

Volumn 3524, Issue , 2005, Pages 34-48

  Bartlett, Mark ^a   Frisch, Alan M ^a   Hamadi, Youssef ^b   Miguel, Ian ^c   Armagan Tarim, S ^d   Unsworth, Chris ^e  

^a UNIVERSITY OF YORK   (United Kingdom)

^b MICROSOFT RESEARCH   (United Kingdom)

^c UNIVERSITY OF ST ANDREWS   (United Kingdom)

^d UNIVERSITY COLLEGE CORK   (Ireland)

^e UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BANDWIDTH; CONSTRAINT THEORY; MULTIPROCESSING SYSTEMS; OPERATIONS RESEARCH; PROBLEM SOLVING;

COMMUNICATION BANDWIDTH; CONSTRAINT PROGRAMMING; KNAPSACK PROBLEM; MULTIPROCESSORS;

LINEAR PROGRAMMING;

EID: 26444445120     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11493853_5     Document Type: Conference Paper

References (16)

1. Foster, I., Kesselman, C., Tuecke, S.: The anatomy of the Grid: Enabling scalable virtual organization. The International Journal of High Performance Computing Applications 15 (2001) 200-222
2. Roy, A., Sander, V.: Advanced reservation API. GFD-E5, Scheduling Working Group, Global Grid Forum (GGF) (2003)
3. Foster, I., Kesselman, C., Nick, J., Tuecke, S.: The physiology of the grid: An open grid services architecture for distributed systems integration (2002)
4. Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990)
5. Fréville, A.: The multidimensional 0-1 knapsack problem: An overview. European Journal of Operational Research 155 (2004) 1-21
6. Walsh, T.: Stochastic constraint programming. In: Proc. of the Fifteenth European Conf. on Artificial Intelligence, IOS Press (2002) 1-5
7. Marinescu, R., Dechter, R.: AND/OR tree search for constraint optimization. In: Proc. of the 6th International Workshop on Preferences and Soft Constraints. (2004)
8. Manna, Z.: The correctness of nondeterministic programs. Artificial Intelligence 1 (1970) 1-26
9. Nilsson, N.J.: Principles of Artificial Intelligence. Tioga (1980)
10. Martelli, A., Montanari, U.: Additive AND/OR graphs. In: Proc. of the Fourth Int. Joint Conf. on Artificial Intelligence. (1975) 345-350
11. Chang, C.L., Slagle, J.: An admissible and optimal algorithm for searching AND/OR graphs. Artificial Intelligence 2 (1971) 117-128
12. Chvatal, V.: Linear Programming. W.H.Freeman, New York (1983)
13. 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. Kluwer Academic Publishers (2000) 19-49
14. Wolsey, L.A.: Integer Programming. John Wiley and Sons, New York (1998)
15. 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 01), Paphos, Cyprus. (2001) 87-98
16. Russell, S.J.: Efficient memory-bounded search methods. In: Proc. of the Tenth European Conf. on Artificial Intelligence, Vienna, Wiley (1992) 1-5