Linear Time Algorithms for Two- and Three-Variable Linear Programs
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date1984/02/01
-
Journal
-
Indian UGC (journal)
-
Refrences10
-
Citations99
-
M. E. Dyer
Cite
Dyer, M. E. “Linear Time Algorithms for Two- and Three-Variable Linear Programs”. SIAM Journal on Computing, vol. 13, no. 1, 1984, pp. 31-45, https://doi.org/10.1137/0213003.
Dyer, M. E. (1984). Linear Time Algorithms for Two- and Three-Variable Linear Programs. SIAM Journal on Computing, 13(1), 31-45. https://doi.org/10.1137/0213003
Dyer ME. Linear Time Algorithms for Two- and Three-Variable Linear Programs. SIAM Journal on Computing. 1984;13(1):31-45.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
You May Also Like
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Title | 1979 | |||
| 10.1515/9781400873173 | 1970 | |||
| Finding the intersection of n half-spaces in time O(n log n) | Theoretical Computer Science |
| 31 | 1979 |
Convex hulls of finite sets of points in two and three dimensions | Communications of the ACM |
| 334 | 1977 |
| Finding the intersection of two convex polyhedra | Theoretical Computer Science |
| 119 | 1978 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming | Computational Optimization and Applications |
| 2022 | |
| Assigning weights to minimize the covering radius in the plane | Computational Geometry |
| 2019 | |
| The double pivot simplex method | Mathematical Methods of Operations Research |
| 2 | 2017 |
| Minimax Regret 1-Median Problem in Dynamic Path Networks | Theory of Computing Systems |
| 2 | 2017 |
| Linear separability in spatial databases | Knowledge and Information Systems |
| 2017 |
Citations Analysis
The category
Technology: Engineering (General). Civil engineering (General) 47
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Computational Geometry—A Survey and was published in 1984. The most recent citation comes from a 2022 study titled Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming. This article reached its peak citation in 1997, with 6 citations. It has been cited in 46 different journals, 2% of which are open access. Among related journals, the European Journal of Operational Research cited this research the most, with 9 citations. The chart below illustrates the annual citation trends for this article.