메뉴 건너뛰기




Volumn 4835 LNCS, Issue , 2007, Pages 609-620

A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; OPTIMIZATION; PROBLEM SOLVING; TIME DELAY;

EID: 38149040867     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77120-3_53     Document Type: Conference Paper
Times cited : (1)

References (11)
  • 2
    • 0038995957 scopus 로고    scopus 로고
    • On matroids with multiple objectives
    • Ehrgott, M.: On matroids with multiple objectives. Optimization 38, 73-84 (1996)
    • (1996) Optimization , vol.38 , pp. 73-84
    • Ehrgott, M.1
  • 5
    • 33244481330 scopus 로고    scopus 로고
    • Khachiyan, L., Boros, E., Borys, K., Elbassioni, K., Gurvich, V.: Generating all vertices of a polyhedron is hard. In: Proc. 17th SODA. Full version to appear in Discrete & Computational Geometry, pp. 758-765 (2006)
    • Khachiyan, L., Boros, E., Borys, K., Elbassioni, K., Gurvich, V.: Generating all vertices of a polyhedron is hard. In: Proc. 17th SODA. Full version to appear in Discrete & Computational Geometry, pp. 758-765 (2006)
  • 6
    • 35048861874 scopus 로고    scopus 로고
    • Nakano, S.-I., Uno, T.: Constant time generation of trees with specified diameter. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, 3353, pp. 33-45. Springer, Heidelberg (2004)
    • Nakano, S.-I., Uno, T.: Constant time generation of trees with specified diameter. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 33-45. Springer, Heidelberg (2004)
  • 7
    • 0034503926 scopus 로고    scopus 로고
    • On the approximability of trade-offs and optimal access of web sources
    • Papadimitriou, C., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: Proc. 41st FOCS, pp. 86-92 (2000)
    • (2000) Proc. 41st FOCS , pp. 86-92
    • Papadimitriou, C.1    Yannakakis, M.2
  • 8
    • 0013458646 scopus 로고
    • The two phase method: An efficient procedure to solve bi-objective combinatorial optimization problems
    • Ulungu, E.L., Teghem, J.: The two phase method: an efficient procedure to solve bi-objective combinatorial optimization problems. Foundations of Computing and Decision Sciences 20, 149-165 (1995)
    • (1995) Foundations of Computing and Decision Sciences , vol.20 , pp. 149-165
    • Ulungu, E.L.1    Teghem, J.2
  • 10
    • 33646737885 scopus 로고    scopus 로고
    • Zaroliagis, C.: Recent advances in multiobjective optimization. In: Lupanov, O.B., Kasim-Zade, O.M., Chaskin, A.V., Steinhöfel, K. (eds.) SAGA 2005. LNCS, 3777, pp. 45-47. Springer, Heidelberg (2005)
    • Zaroliagis, C.: Recent advances in multiobjective optimization. In: Lupanov, O.B., Kasim-Zade, O.M., Chaskin, A.V., Steinhöfel, K. (eds.) SAGA 2005. LNCS, vol. 3777, pp. 45-47. Springer, Heidelberg (2005)
  • 11
    • 33646521128 scopus 로고    scopus 로고
    • A tutorial on evolutionary multiobjective optimization
    • Gandibleux, X, Sevaux, M, Sörensen, K, T'kindt, V, eds, Metaheuristics for Multiobjective Optimisation
    • Zitzler, E., Laumanns, M., Bleuler, S.: A tutorial on evolutionary multiobjective optimization. In: Gandibleux, X., Sevaux, M., Sörensen, K., T'kindt, V. (eds.) Metaheuristics for Multiobjective Optimisation, Lecture Notes in Economics and Mathematical Systems, vol. 535, pp. 3-38 (2004)
    • (2004) Lecture Notes in Economics and Mathematical Systems , vol.535 , pp. 3-38
    • Zitzler, E.1    Laumanns, M.2    Bleuler, S.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.