Multiobjective optimization: Improved FPTAS for shortest paths and non-linear objectives with applications

Theory of Computing Systems

Volumn 45, Issue 1, 2009, Pages 162-186

  Tsaggouris, George ^a,b   Zaroliagis, Christos ^a,b  

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

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

FPTAS; Multiobjective optimization; Multiobjective shortes path; Multiple constrained (optimal) path; Non additive shortest path; Non linear objectives; Qos aware multicommodity flow

Indexed keywords

FPTAS; MULTI OBJECTIVE; MULTI-COMMODITY FLOW; MULTIPLE CONSTRAINED (OPTIMAL) PATH; NON-LINEAR OBJECTIVES; SHORTEST PATH;

CONSTRAINED OPTIMIZATION; GRAPH THEORY;

MULTIOBJECTIVE OPTIMIZATION;

EID: 67349120856     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-007-9096-4     Document Type: Article

References (33)

1. Ackermann, H., Newman, A., Röglin, H., Vöcking, B.: Decision making based on approximate and smoothed Pareto curves. In: Algorithms and Computation, ISAAC 2005. Lecture Notes in Computer Science, vol. 3827, pp. 675-684. Springer, Berlin (2006). Full version as Tech. Report AIB-2005-23, RWTH Aachen, December (2005)
2. Beckmann, M., McGuire, G., Winsten, C.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)
3. Chaudhuri, K., Papadimitriou, C., Rao, S.: Optimum routing with quality of service constraints. Manuscript (2004)
4. H. Corley I. Moon 1985 Shortest paths in networks with vector weights J. Optim. Theory Appl. 46 1 79 86
5. S. Dafermos 1982 The general multimodal network equilibrium problem with elastic demands Networks 12 57 72 (Pubitemid 13492889)
6. A. Datta D. Vandermeer A. Celik V. Kumar 1999 Broadcast protocols to support efficient retrieval from databases by mobile users ACM Trans. Database Syst. 24 1 1 79 (Pubitemid 129598105)
7. Ehrgott, M.: Multicriteria Optimization. Springer, Berlin (2000)
8. Ehrgott, M., Gandibleux, X. (eds.): Multiple Criteria Optimization-State of the Art Annotated Bibliographic Surveys. Kluwer Academic, Boston (2002)
9. F. Ergun R. Sinha L. Zhang 2002 An improved FPTAS for restricted shortest path Inf. Process. Lett. 83 287 291 (Pubitemid 34704436)
10. Figueira, J., Greco, S., Ehrgott, M. (eds.): Multiple Criteria Decision Analysis-State of the Art Surveys. Springer, Boston (2005)
11. L.K. Fleischer 2000 Approximating fractional multicommodity flows independent of the number of commodities SIAM J. Discrete Math. 13 4 505 520
12. M. Florian S. Nguyen 1974 A method for computing network equilibrium with elastic demands Transp. Sci. 8 321 332
13. S. Gabriel D. Bernstein 1997 The traffic equilibrium problem with nonadditive path costs Transp. Sci. 31 4 337 348 (Pubitemid 127601475)
14. S. Gabriel D. Bernstein 2000 Nonadditive shortest paths: subproblems in multi-agent competitive network models Comput. Math. Organ. Theory 6 29 45
15. Garg, N., Könemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In: Proc. 39th IEEE Symposium on Foundations of Computer Science, FOCS'98, pp. 300-309. IEEE CS Press (1998)
16. Garg, N., Könemann, J.: Personal communication (2005)
17. Goel, A., Ramakrishnan, K.G., Kataria, D., Logothetis, D.: Efficient computation of delay-sensitive routes from one source to all destinations. In: Proc. IEEE Conf. Comput. Commun. INFOCOM (2001)
18. Hansen, P.: Bicriterion Path Problems. In: Theory and Applications. Proc. 3rd Conf. Multiple Criteria Decision Making. Lecture Notes in Economics and Mathematical Systems, vol. 117, pp. 109-127. Springer, Berlin (1979)
19. R. Hassin 1992 Approximation schemes for the restricted shortest path problem Math. Oper. Res. 17 36 42
20. Hensen, D., Truong, T.: Valuation of travel times savings. J. Transp. Econ. Policy 237-260 (1985)
21. Korkmaz, T., Kruz, M.: Multiconstrained optimal path selection. In: Proc. IEEE Conf. Comput. Commun. INFOCOM, pp. 834-843 (2001)
22. D.H. Lorenz D. Raz 2001 A simple efficient approximation scheme for the restricted shortest path problem Oper. Res. Lett. 28 213 219
23. Van Mieghem, P., Kuipers, F.A., Korkmaz, T., Krunz, M., Curado, M., Monteiro, E., Masip-Bruin, X., Sole-Pareta, J., Sanchez-Lopez, S.: Quality of service routing. In: Quality of Future Internet Services. Lecture Notes in Computer Science, vol. 2856, pp. 80-117. Springer, Berlin (2003) (Pubitemid 137635435)
24. Papadimitriou, C., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: Proc. 41st Symp. on Foundations of Computer Science, FOCS, pp. 86-92 (2000)
25. PIN project (Projekt Integrierte Netzoptimierung): Deutsche Bahn AG (2000)
26. Scott, K., Bernstein, D.: Solving a best path problem when the value of time function is nonlinear. Preprint 980976 of the Annual Meeting of the Transportation Research Board (1997)
27. Tsaggouris, G., Zaroliagis, C.: Improved FPTAS for multiobjective shortest paths with applications. CTI Techn. Report TR-2005/07/03, July (2005)
28. Tsaggouris, G., Zaroliagis, C.: QoS-aware multicommodity flows and transportation planning. In: Proc. 6th Workshop on Algorithmic Methods and Models for Optimization of Railways, ATMOS (2006)
29. Tsaggouris, G., Zaroliagis, C.: Multiobjective optimization: Improved FPTAS for shortest paths and non-linear objectives with applications. In: Algorithms and Computation, ISAAC 2006. Lecture Notes in Computer Science, vol. 4288, pp. 389-398. Springer, Berlin (2006)
30. Vassilvitskii, S., Yannakakis, M.: Efficiently computing succinct trade-off curves. In: Automata, Languages, and Programming, ICALP 2004. Lecture Notes in Computer Science, vol. 3142, pp. 1201-1213. Springer, Berlin (2004) (Pubitemid 39746290)
31. Wagner, F.: Challenging optimization problems at deutsche bahn. AMORE Workshop (invited talk) (1999)
32. A. Warburton 1987 Approximation of Pareto optima in multiple-objective shortest path problems Oper. Res. 35 70 79 (Pubitemid 17620345)
33. Young, N.: Sequential and parallel algorithms for mixed packing and covering. In: Proc. 42nd IEEE Symp. on Foundations of Computer Science, FOCS, pp. 538-546 (2001)