메뉴 건너뛰기




Volumn 21, Issue 1, 2009, Pages 39-48

Pareto optima of multicriteria integer linear programs

Author keywords

Analysis of algorithms; Combinatorics; Computational complexity; Integer programming; Mathematics; Multicriteria programming

Indexed keywords


EID: 67649992783     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1080.0277     Document Type: Article
Times cited : (17)

References (15)
  • 1
    • 0000975439 scopus 로고
    • Polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed
    • Barvinok, A. I. 1994. Polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Math. Oper. Res. 19 769-779.
    • (1994) Math. Oper. Res , vol.19 , pp. 769-779
    • Barvinok, A.I.1
  • 2
    • 0002646505 scopus 로고    scopus 로고
    • An algorithmic theory of lattice points in polyhedra
    • L. J. Billera, A. Björner, C. Greene, R. E. Simion, R. P. Stanley, eds, Cambridge University Press, Cambridge, UK
    • Barvinok, A. I., J. E. Pommersheim. 1999. An algorithmic theory of lattice points in polyhedra. L. J. Billera, A. Björner, C. Greene, R. E. Simion, R. P. Stanley, eds. New Perspectives in Algebraic Combinatorics, Mathematical Sciences Research Institute Publications, Vol. 38. Cambridge University Press, Cambridge, UK, 91-147.
    • (1999) New Perspectives in Algebraic Combinatorics, Mathematical Sciences Research Institute Publications , vol.38 , pp. 91-147
    • Barvinok, A.I.1    Pommersheim, J.E.2
  • 3
    • 0141680581 scopus 로고    scopus 로고
    • Short rational generating functions for lattice point problems
    • Barvinok, A. I., K. Woods. 2003. Short rational generating functions for lattice point problems. J. Amer. Math. Soc. 16 957-979.
    • (2003) J. Amer. Math. Soc , vol.16 , pp. 957-979
    • Barvinok, A.I.1    Woods, K.2
  • 4
    • 67649962536 scopus 로고    scopus 로고
    • Personal communication, September 3
    • Blanco, V. 2007. Personal communication, September 3.
    • (2007)
    • Blanco, V.1
  • 7
    • 0001322778 scopus 로고    scopus 로고
    • A survey and annotated bibliography of multiobjective combinatorial optimization
    • Ehrgott, M., X. Gandibleux. 2000. A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spektrum22 425-460.
    • (2000) OR Spektrum , vol.22 , pp. 425-460
    • Ehrgott, M.1    Gandibleux, X.2
  • 8
    • 0442289298 scopus 로고
    • On the cardinality of the set of alternatives in discrete many-criterion problems
    • Emelichev, V. A., V. A. Perepelitsa. 1992. On the cardinality of the set of alternatives in discrete many-criterion problems. Discrete Math. Appl. 2 461-471.
    • (1992) Discrete Math. Appl , vol.2 , pp. 461-471
    • Emelichev, V.A.1    Perepelitsa, V.A.2
  • 10
    • 0000583822 scopus 로고
    • Proper efficiency and the linear vector maximum problem
    • Isermann, H. 1974. Proper efficiency and the linear vector maximum problem. Oper. Res. 22 189-191.
    • (1974) Oper. Res , vol.22 , pp. 189-191
    • Isermann, H.1
  • 12
    • 0000408683 scopus 로고
    • The Gröbner fan of an ideal
    • Mora, T., L. Robbiano. 1988. The Gröbner fan of an ideal. J. Symbolic Comput. 6 183-208.
    • (1988) J. Symbolic Comput , vol.6 , pp. 183-208
    • Mora, T.1    Robbiano, L.2
  • 13
    • 0004262557 scopus 로고
    • Sawaragi, Y, H. Nakayama, T. Tanino, eds, Academic Press, Orlando, FL
    • Sawaragi, Y., H. Nakayama, T. Tanino, eds. 1985. Theory of Multiobjective Optimization. Academic Press, Orlando, FL.
    • (1985) Theory of Multiobjective Optimization
  • 14
    • 34250103544 scopus 로고
    • Finding the set of alternatives in discrete multi-criterion problems
    • Sergienko, I. V., V. A. Perepelitsa. 1991. Finding the set of alternatives in discrete multi-criterion problems. Cybernetics 3673-683.
    • (1991) Cybernetics , vol.3 , pp. 673-683
    • Sergienko, I.V.1    Perepelitsa, V.A.2


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