SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Discrete & Computational Geometry

Volumn 8, Issue 1, 1992, Pages 295-313

A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra

(2) Avis, David a Fukuda, Komei b

a MCGILL UNIVERSITY (Canada)

b UNIVERSITY OF TSUKUBA (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34249842390 PISSN: 01795376 EISSN: 14320444 Source Type: Journal
DOI: 10.1007/BF02293050 Document Type: Article

Times cited : (432)

References (23)

1
- 0002995518
- Notes on Bland's Pivoting Rule
- (1978) Math. Programming Study. , vol.8 , pp. 24-34
- Avis, D.¹ Chvátal, V.²

2
- 0000652462
- New Finite Pivoting Rules for the Simplex Method
- (1977) Mathematics of Operations Research , vol.2 , pp. 103-107
- Bland, R.G.¹

3
- 0014705383
- An Algorithm for Convex Polytopes
- (1970) Journal of the ACM , vol.17 , pp. 78-86
- Chand, D.R.¹ Kapur, S.S.²

4
- 84936710779
- B. Chazelle, An Optimal Convex Hull Algorithm and New Results on Cuttings, Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science, pp. 29–38, 1991.

5
- 0004139889
- Freeman, San Francisco
- (1983) Linear Programming
- Chvátal, V.¹

6
- 0020799155
- The Complexity of Vertex Enumeration Methods
- (1983) Math. Oper. Res. , vol.8 , pp. 381-402
- Dyer, M.E.¹

7
- 0003516674
- Springer-Verlag, New York
- (1987) Algorithms in Combinatorial Geometry
- Edelsbrunner, H.¹

8
- 0024606073
- Topologically Sweeping an Arrangement
- (1989) J. Comput. Syst. Sci. , vol.38 , pp. 165-194
- Edelsbrunner, H.¹ Guibas, L.²

9
- 0022714544
- Constructing Arrangements of Lines and Hyperplanes with Applications
- (1986) SIAM J. Comput. Sci. , vol.15 , pp. 341-363
- Edelsbrunner, H.¹ O'Rourke, J.² Seidel, R.³

10
- 84936710778
- K. Fukuda, Oriented Matroid Programming, Ph.D. Thesis, University of Waterloo, 1982.

11
- 84936710781
- K. Fukuda and T. Matsui, On the Finiteness of the Criss-Cross Method, European J. Oper. Res., to appear.

12
- 84936710780
- Houle, M.E.¹ Imai, H.² Imai, K.³

13
- 0019016261
- A Survey and Comparison of Methods for Finding all Vertices of Convex Polyhedral Sets
- (1980) Mathematics of Operations Research , vol.5 , pp. 167-185
- Mattheiss, T.H.¹ Rubin, D.S.²

14
- 41249086605
- Annals of Mathematical Studies, 8, Princeton University Press, Princeton, NJ
- (1953) The Double Description Method
- Motzkin, T.S.¹ Raiffa, H.² Thompson, G.L.³ Thrall, R.M.⁴

15
- 0012742221
- Pivoting Rules Directing the Simplex Method Through all Feasible Vertices of Klee-Minty Examples
- (1989) OPSEARCH , vol.26 , pp. 77-95
- Paparrizos, K.¹

16
- 0027002217
- ACM Press, New York
- (1992) Degenerate Convex Hulls in High Dimensions Without Extra Storage , pp. 26-32
- Rote, G.¹

17
- 84936710863
- R. Seidel, A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions, Report 81-14, Department of Computer Science, University of British Columbia, 1981.

18
- 84936710865
- R. Seidel, Constructing Higher-Dimensional Convex Hulls at Logarithmic Cost per Face, Proc. 1986 Symposium on the Theory of Computing, pp. 404–413.

19
- 0001090452
- A Convergent Criss-Cross Method
- (1985) Math. Operationsforsch. Statist. Ser. Optim. , vol.16 , pp. 683-690
- Terlaky, T.¹

20
- 0040915269
- A Finite Criss-Cross Method for Oriented Matroids
- (1987) J. Combin. Theory Ser. B , vol.42 , pp. 319-327
- Terlaky, T.¹

21
- 0042926851
- Linear and Quadratic Programming in Oriented Matroids
- (1985) J. Combin. Theory Ser. B , vol.39 , pp. 105-133
- Todd, M.¹

22
- 0040321297
- A Conformal Elimination Free Algorithm for Oriented Matroid Programming
- (1987) Chinese Ann. Math. , vol.8 , pp. 1
- Wang, Z.¹

23
- 84936710864
- D. Avis and K. Fukuda, Reverse Search for Enumeration, Research Report 92-5, GSSM, University of Tsukuba, April 1992.

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