Recent advances in multiobjective optimization

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

Volumn 3777 LNCS, Issue , 2005, Pages 45-47

  Zaroliagis, Christos ^a,b  

^a University of Patras and Computer Technology Institute   (Greece)

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33646737885     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11571155_5     Document Type: Conference Paper

References (12)

1. M. Ehrgott, Multicriteria Optimization, Springer, 2000.
2. M. Ehrgott and X. Gandibleux (Eds), Multiple Criteria Optimization - state of the art annotated bibliographic surveys, Kluwer Academic Publishers, Boston, 2002.
3. O. Etzioni, S. Hanks, T. Jiang, R. Karp, O. Madari, and O. Waarts, "Efficient Information Gathering on the Internet", in Proc. 37th IEEE Symp. on Foundations of Computer Science - FOCS 1996, pp. 234-243.
4. G. Handler and I. Zang, "A Dual Algorithm for the Constrained Shortest Path Problem", Networks 10(1980), pp. 293-310.
5. P. Hansen, "Bicriterion Path Problems", Proc. 3rd Conf. Multiple Criteria Decision Making - Theory and Applications, LNEMS Vol. 117 (Springer, 1979), pp. 109-127.
6. M. Marathe, R. Ravi, R. Sundaram, S.S. Ravi, D. Rosenkrantz, and H.B. Hunt, "Bicriteria Network Design Problems", Journal of Algorithms 28 (1998), pp. 142-171.
7. C. Papadimitriou and M. Yannakakis, "On the Approximability of Trade-offs and Optimal Access of Web Sources", in Proc. 41st IEEE Symp. on Foundations of Computer Science - FOCS 2000, pp. 86-92.
8. R. Ravi, M. Marathe, S.S. Ravi, D. Rosenkrantz, and H.B. Hunt, "Many Birds with One Stone: Multi-objective Approximation Algorithms", in Proc. 25th ACM Symp. on Theory of Computing - STOC 1993, pp. 438-447.
9. G. Tsaggouris and C. Zaroliagis, "Non-Additive Shortest Paths", in Algorithms - ESA 2004, LNCS Vol. 3221 (Springer-Verlag, 2004), pp. 822-834.
10. G. Tsaggouris and C. Zaroliagis, "Improved FPTAS for Multiobjective Shortest Paths with Applications", CTI Technical Report TR 2005/07/03, July 2005.
11. S. Vassilvitskii and M. Yannakakis, "Efficiently Computing Succinct Trade-off Curves", in Automata, Languages, and Programming - ICALP 2004, LNCS Vol. 3142 (Springer, 2004), pp. 1201-1213.
12. A. Warburton, "Approximation of Pareto Optima in Multiple-Objective Shortest Path Problems", Operations Research 35(1987), pp. 70-79.