Strategies for global optimization of temporal preferences

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3258, Issue , 2004, Pages 408-422

  Morris, Paul ^a   Morris, Robert ^a   Khatib, Lina ^a   Ramakrishnan, Sailesh ^a   Bachmann, Andrew ^a  

^a NASA AMES RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

OPTIMAL SOLUTIONS; PREFERRED SOLUTIONS; SOLUTION TECHNIQUES; SUB CLASS; TEMPORAL CONSTRAINTS; TEMPORAL REASONING;

GLOBAL OPTIMIZATION;

EID: 35048898847     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30201-8_31     Document Type: Article

References (14)

1. F. Ajili and H. El Sakkout. A probe-based algorithm for piecewise linear optimization in scheduling. Annals of Operations Research, 118:25-48, 2003.
2. F. Bacchus and A. Grove. Graphical models for preference and utility. In Proceedings of the Eleventh Conference of Uncertainty in Artificial Intelligence, pages 3-10. Morgan Kaufmann, 1995.
3. J. Bresina, K. Golden, D. Smith, and R. Washington. Increased flexibility and robustness of mars rovers. In Proceedings of the 5th International Symposium on Artificial Intelligence, Robotics and Automation for Space, ESTEC, Noordwijk, Netherlands, 1999.
4. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. MIT press, 1990.
5. R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artificial Intelligence, 49:61-95, 1991.
6. D. Dubois, H. Fargier, and H. Prade. Possibility theory in constraint satisfaction problems: Handling priority, preference and uncertainty. Applied Intelligence, 6(4):287-309, 1996.
7. M. Ehrgott. Discrete decision problems, multiple criteria optimization classes and lexico-graphic max-ordering. In Trends in Multicriteria Decision Making, volume 465 of Lecture Notes in Economics and Mathematical Systems, pages 31-44. Springer, 1998.
8. Ulrich Junker. Preference-based search and multi-criteria optimization. In Proceedings of AAAI-02. AAAI Press, 2003.
9. L. Khatib, P. Morris, R. Morris, and F. Rossi. Temporal reasoning about preferences. In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI-01), Seattle (WA, USA), 2001. Morgan Kaufmann, San Francisco, CA.
10. L. Khatib, P. Morris, R. Morris, and B. Venable. Tractable pareto optimization of temporal preferences. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), Acupulco, Mexico, 2003. Morgan Kaufmann, San Francisco, CA.
11. N. Muscettola, P. Morris, and I. Tsamardinos. Reformulating temporal plans for efficient execution. In Proceedings of Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), 1998.
12. H. El Sakkout, M. Wallace, and T. Richards. Minimal perturbance in dynamic scheduling. In Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98), pages 504-508, 1998.
13. A. Schrijver. Theory of linear and integer programming. John Wiley and Sons, NY, 1986.
14. Paolo Toth and Daniele Vigo. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA, 2000.