메뉴 건너뛰기




Volumn 3669, Issue , 2005, Pages 887-898

Optimizing a 2D function satisfying unimodality properties

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; NUMBER THEORY; OPTIMIZATION;

EID: 27144538236     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_78     Document Type: Conference Paper
Times cited : (10)

References (10)
  • 2
    • 38249002105 scopus 로고
    • On the deterministic complexity of searching local maxima
    • I. Althöfer and K.-U. Koschnick. On the deterministic complexity of searching local maxima. Discrete Appl. Math., 43(2):111-113, 1993.
    • (1993) Discrete Appl. Math. , vol.43 , Issue.2 , pp. 111-113
    • Althöfer, I.1    Koschnick, K.-U.2
  • 3
    • 0000551431 scopus 로고
    • Computing the extreme distances between two convex polygons
    • H. Edelsbrunner. Computing the extreme distances between two convex polygons. J. Algorithms, 6:213-224, 1985.
    • (1985) J. Algorithms , vol.6 , pp. 213-224
    • Edelsbrunner, H.1
  • 4
    • 0027113268 scopus 로고
    • Dynamic programming with convexity, concavity and sparsity
    • Jan.
    • Z. Galil and K. Park. Dynamic programming with convexity, concavity and sparsity. Theoret. Computer Sci., 92(1):49-76, Jan. 1992.
    • (1992) Theoret. Computer Sci. , vol.92 , Issue.1 , pp. 49-76
    • Galil, Z.1    Park, K.2
  • 5
    • 23944500027 scopus 로고    scopus 로고
    • Unique sink orientations of grids
    • Proc. 11th Internat. IPCO Conf. on Integer Prog. and Combinat. Opt., Berlin, Germany, June
    • B. Gärtner, W. D. Morris, and L. Rüst. Unique sink orientations of grids. In Proc. 11th Internat. IPCO Conf. on Integer Prog. and Combinat. Opt., volume 3509 of Lecture Notes in Computer Science, pages 210-224, Berlin, Germany, June 2005.
    • (2005) Lecture Notes in Computer Science , vol.3509 , pp. 210-224
    • Gärtner, B.1    Morris, W.D.2    Rüst, L.3
  • 6
    • 84968496713 scopus 로고
    • Sequential minimax search for a maximum
    • J. Kiefer. Sequential minimax search for a maximum. Proc. Amer. Math. Soc., 4:502-506, 1953.
    • (1953) Proc. Amer. Math. Soc. , vol.4 , pp. 502-506
    • Kiefer, J.1
  • 8
    • 38249003036 scopus 로고
    • Dividing and conquering the square
    • D. C. Llewellyn and C. A. Tovey. Dividing and conquering the square. Discrete Appl. Math., 43(2): 131-153, 1993.
    • (1993) Discrete Appl. Math. , vol.43 , Issue.2 , pp. 131-153
    • Llewellyn, D.C.1    Tovey, C.A.2
  • 9
    • 0242692617 scopus 로고    scopus 로고
    • On the complexity of finding a local maximum of functions on discrete planar subsets
    • Jan.
    • A. Mityagin. On the complexity of finding a local maximum of functions on discrete planar subsets. Theoret. Computer Sci., 310(1-3):355-363, Jan. 2004.
    • (2004) Theoret. Computer Sci. , vol.310 , Issue.1-3 , pp. 355-363
    • Mityagin, A.1
  • 10
    • 85191114019 scopus 로고    scopus 로고
    • Local improvement on discrete structures
    • John Wiley and Sons
    • C. A. Tovey. Local improvement on discrete structures. In Local Search in Combinatorial Optimization, pages 57-89. John Wiley and Sons, 1997.
    • (1997) Local Search in Combinatorial Optimization , pp. 57-89
    • Tovey, C.A.1


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