메뉴 건너뛰기




Volumn 124, Issue 1-3, 2002, Pages 1-15

Vertex characterization of partition polytopes of bipartitions and of planar point sets

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84867955940     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00326-2     Document Type: Article
Times cited : (4)

References (10)
  • 2
    • 84868003271 scopus 로고    scopus 로고
    • M.Sc. Dissertation, Davidson Faculty of IE & M, Technion-Israel Institute of Technology
    • S. Aviran, Vertex characterization of shaped partition polytopes, M.Sc. Dissertation, Davidson Faculty of IE & M, Technion-Israel Institute of Technology, 1999.
    • (1999) Vertex Characterization of Shaped Partition Polytopes
    • Aviran, S.1
  • 3
    • 0026815128 scopus 로고
    • Optimal partitions having disjoint convex and conic hulls
    • E.R. Barnes, A.J. Hoffman, and U.G. Rothblum Optimal partitions having disjoint convex and conic hulls Math. Programming 54 1992 69 86
    • (1992) Math. Programming , vol.54 , pp. 69-86
    • Barnes, E.R.1    Hoffman, A.J.2    Rothblum, U.G.3
  • 4
    • 0022101120 scopus 로고
    • Consecutive optimizers for a partitioning problem with applications to optimal inventory groupings for joint replenishment
    • A.K. Chakravarty, J.B. Orlin, and U.G. Rothblum Consecutive optimizers for a partitioning problem with applications to optimal inventory groupings for joint replenishment Oper. Res. 33 1985 820 834
    • (1985) Oper. Res. , vol.33 , pp. 820-834
    • Chakravarty, A.K.1    Orlin, J.B.2    Rothblum, U.G.3
  • 5
    • 84974054501 scopus 로고
    • The number of partitions of a set of n points in k dimensions induced by hyperplanes
    • E.F. Harding The number of partitions of a set of n points in k dimensions induced by hyperplanes Proc. Edinburgh. Math. Soc. 15 1967 285 289
    • (1967) Proc. Edinburgh. Math. Soc. , vol.15 , pp. 285-289
    • Harding, E.F.1
  • 6
    • 0033271978 scopus 로고    scopus 로고
    • A polynomial time algorithm for shaped partition problems
    • F.K. Hwang, S. Onn, and U.G. Rothblum A polynomial time algorithm for shaped partition problems SIAM J. Optim. 10 1999 70 81
    • (1999) SIAM J. Optim. , vol.10 , pp. 70-81
    • Hwang, F.K.1    Onn, S.2    Rothblum, U.G.3
  • 8
    • 0028460940 scopus 로고
    • Optimality of monotone assemblies for coherent systems composed of series modules
    • F.K. Hwang, and U.G. Rothblum Optimality of monotone assemblies for coherent systems composed of series modules Oper. Res. 42 1994 709 720
    • (1994) Oper. Res. , vol.42 , pp. 709-720
    • Hwang, F.K.1    Rothblum, U.G.2
  • 9
    • 84867986627 scopus 로고    scopus 로고
    • Ph.D. Dissertation, Applied Mathematics, Technion-Israel Institute of Technology, in preparation
    • N. Lev-Tov, 2-dimensional partition problems, Ph.D. Dissertation, Applied Mathematics, Technion-Israel Institute of Technology, in preparation.
    • 2-dimensional Partition Problems
    • Lev-Tov, N.1


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