×

zbMATH — the first resource for mathematics

Khachiyan, Leonid Genrikhovich

Compute Distance To:
Author ID: khachiyan.leonid-g Recent zbMATH articles by "Khachiyan, Leonid Genrikhovich"
Published as: Hačijan, L. G.; Khachiyan, L.; Khachiyan, L. G.; Khachiyan, Leonid; Khachiyan, Leonid G.
External Links: MGP · Math-Net.Ru · Wikidata · dblp
Documents Indexed: 90 Publications since 1977, including 1 Book
Biographic References: 4 Publications

Publications by Year

Citations contained in zbMATH

86 Publications have been cited 1,296 times in 892 Documents Cited by Year
A polynomial algorithm in linear programming. Zbl 0414.90086
Khachiyan, L. G.
257
1979
On the complexity of dualization of monotone disjunctive normal forms. Zbl 0864.68038
Fredman, Michael L.; Khachiyan, Leonid
104
1996
A polynomial algorithm in linear programming. Zbl 0409.90079
Hačijan, L. G.
99
1979
Polynomial algorithms in linear programming. Zbl 0459.90047
Khachiyan, L. G.
69
1980
Polynomial solvability of convex quadratic programming. Zbl 0434.90071
Kozlov, M. K.; Tarasov, S. P.; Khachiyan, L. G.
43
1979
Cyclic games and an algorithm to find minimax cycle means in directed graphs. Zbl 0695.90105
Gurvich, V. A.; Karzanov, A. V.; Khachiyan, L. G.
42
1988
On the complexity of approximating the maximal inscribed ellipsoid for a polytope. Zbl 0792.90088
Khachiyan, Leonid G.; Todd, Michael J.
34
1993
On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions. Zbl 0953.06013
Gurvich, V.; Khachiyan, L.
29
1999
Rounding of polytopes in the real number model of computation. Zbl 0856.68066
Khachiyan, Leonid G.
29
1996
Generating all vertices of a polyhedron is hard. Zbl 1147.05040
Khachiyan, Leonid; Boros, Endre; Borys, Konrad; Elbassioni, Khaled; Gurvich, Vladimir
24
2008
Coordination complexity of parallel price-directive decomposition. Zbl 0857.90100
Grigoriadis, Michael D.; Khachiyan, Leonid G.
23
1996
Dual-bounded generating problems: All minimal integer solutions for a monotone system of linear inequalities. Zbl 1041.68064
Boros, E.; Elbassioni, K.; Gurvich, V.; Khachiyan, L.; Makino, K.
22
2002
A sublinear-time randomized approximation algorithm for matrix games. Zbl 0857.90144
Grigoriadis, Michael D.; Khachiyan, Leonid G.
21
1995
On the conductance of order Markov chains. Zbl 0736.06002
Karzanov, Alexander; Khachiyan, Leonid
21
1991
The method of inscribed ellipsoids. Zbl 0685.90077
Tarasov, S. P.; Khachiyan, L. G.; Ehrlikh, I. I.
21
1988
Generating maximal independent sets for hypergraphs with bounded edge-intersections. Zbl 1196.05057
Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Khachiyan, Leonid
20
2004
On the complexity of semidefinite programs. Zbl 0881.90127
Porkolab, Lorant; Khachiyan, Leonid
19
1997
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation. Zbl 1110.68104
Khachiyan, Leonid; Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir
18
2006
Fast approximation schemes for convex programs with many blocks and coupling constraints. Zbl 0808.90105
Grigoriadis, Michael D.; Khachiyan, Leonid G.
18
1994
The polynomial solvability of convex quadratic programming. Zbl 0486.90068
Kozlov, M. K.; Tarasov, S. P.; Khachiyan, L. G.
18
1980
On the complexity of some enumeration problems for matroids. Zbl 1104.05017
Khachiyan, L.; Boros, E.; Elbassioni, K.; Gurvich, V.; Makino, K.
17
2006
On the complexity of generating maximal frequent and minimal infrequent sets. Zbl 1054.68072
Boros, E.; Gurvich, V.; Khachiyan, L.; Makino, K.
17
2002
Approximate max-min resource sharing for structured concave optimization. Zbl 1010.90060
Grigoriadis, M. D.; Khachiyan, L. G.; Porkolab, L.; Villavicencio, J.
15
2001
Dual-bounded generating problems: Partial and multiple transversals of a hypergraph. Zbl 0980.68077
Boros, Endre; Gurvich, Vladimir; Khachiyan, Leonid; Makino, Kazuhisa
15
2001
Diagonal matrix scaling and linear programming. Zbl 0770.90043
Khachiyan, Leonid; Kalantari, Bahman
14
1992
Integer optimization on convex semialgebraic sets. Zbl 0966.90059
Khachiyan, L.; Porkolab, L.
13
2000
On the complexity of nonnegative-matrix scaling. Zbl 0849.15003
Kalantari, Bahman; Khachiyan, Leonid
13
1996
A greedy heuristic for a minimum-weight forest problem. Zbl 0804.90124
Imielińska, Celina; Kalantari, Bahman; Khachiyan, Leonid
13
1993
The problem of calculating the volume of a polyhedron is enumerably hard. Zbl 0692.68034
Khachiyan, L. G.
13
1989
Polynomial algorithms in linear programming. Zbl 0431.90043
Khachiyan, L. G.
11
1980
A global parallel algorithm for the hypergraph transversal problem. Zbl 1185.68838
Khachiyan, Leonid; Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir
10
2007
On maximal frequent and minimal infrequent sets in binary matrices. Zbl 1038.68041
Boros, E.; Gurvich, V.; Khachiyan, L.; Makino, K.
10
2003
On the complexity of approximating extremal determinants in matrices. Zbl 0819.65085
Khachiyan, Leonid
9
1995
Complexity of polytope volume computation. Zbl 0789.52016
Khachiyan, Leonid
9
1993
An intersection inequality for discrete distributions and related generation problems. Zbl 1060.90691
Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Khachiyan, Leonid; Makino, Kazuhisa
8
2003
Approximating fixed points of weakly contracting mappings. Zbl 0948.65055
Huang, Z.; Khachiyan, L.; Sikorski, K.
8
1999
Cyclic games and determination of minimax mean cycles in digraphs. Zbl 0661.90108
Gurvich, V. A.; Karzanov, A. V.; Khachiyan, L. G.
8
1988
Extending Dijkstra’s algorithm to maximize the shortest path by node-wise limited arc interdiction. Zbl 1185.90198
Khachiyan, Leonid; Gurvich, Vladimir; Zhao, Jihui
7
2006
A new algorithm for the hypergraph transversal problem. Zbl 1128.05306
Khachiyan, Leonid; Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir
7
2005
Enumerating minimal dicuts and strongly connected subgraphs and related geometric problems. Zbl 1092.68074
Boros, E.; Elbassioni, K.; Gurvich, V.; Khachiyan, L.
7
2004
An inequality for polymatroid functions and its applications. Zbl 1033.05023
Boros, E.; Elbassioni, K.; Gurvich, V.; Khachiyan, L.
7
2003
On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms. Zbl 0795.65022
Kalantari, Bahman; Khachiyan, Leonid
7
1993
Dual-bounded generating problems: Weighted transversals of a hypergraph. Zbl 1062.68083
Boros, E.; Gurvich, V. A.; Khachiyan, L.; Makino, K.
6
2004
Generating dual-bounded hypergraphs. Zbl 1065.05066
Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Khachiyan, Leonid
6
2002
Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time. Zbl 0874.90085
Grigoriadis, Michael D.; Khachiyan, Leonid G.
6
1996
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs. Zbl 1125.68088
Khachiyan, Leonid; Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir
5
2007
Generating all vertices of a polyhedron is hard. Zbl 1192.52022
Khachiyan, Leonid; Boros, Endre; Borys, Konrad; Elbassioni, Khaled; Gurvich, Vladimir
5
2006
Generating partial and multiple transversals of a hypergraph. Zbl 0973.68182
Boros, Endre; Gurvich, Vladimir; Khachiyan, Leonid; Makino, Kazuhisa
5
2000
On the frequency of the most frequently occurring variable in dual monotone DNFs. Zbl 0872.06012
Gurvich, Vladimir; Khachiyan, Leonid
5
1997
On the complexity of matrix balancing. Zbl 0882.65031
Kalantari, B.; Khachiyan, L.; Shokoufandeh, A.
5
1997
An exponential-function reduction method for block-angular convex programs. Zbl 0856.90089
Grigoriadis, Michael D.; Khachiyan, Leonid G.
5
1995
Approximate solution of matrix games in parallel. Zbl 0814.90134
Grigoriadis, Michael D.; Khachiyan, Leonid G.
5
1992
Generating cut conjunctions and bridge avoiding extensions in graphs. Zbl 1147.68609
Khachiyan, L.; Boros, E.; Borys, K.; Elbassioni, K.; Gurvich, V.; Makino, K.
4
2005
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals. Zbl 1266.68199
Boros, E.; Elbassioni, K.; Gurvich, V.; Khachiyan, Leonid
4
2003
On generating all minimal integer solutions for a monotone system of linear inequalities. Zbl 0986.90024
Boros, E.; Elbassioni, K.; Gurvich, V.; Khachiyan, L.; Makino, K.
4
2001
Generating cut conjunctions in graphs and related problems. Zbl 1147.68060
Khachiyan, Leonid; Boros, Endre; Borys, Konrad; Elbassioni, Khaled; Gurvich, Vladimir; Makino, Kazuhisa
3
2008
Enumerating spanning and connected subsets in graphs and matroids. Zbl 1131.05305
Khachiyan, L.; Boros, E.; Borys, K.; Elbassioni, K.; Gurvich, V.; Makino, K.
3
2006
Generating paths and cuts in multi-pole (di)graphs. Zbl 1096.68117
Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Khachiyan, Leonid; Makino, Kazuhisa
3
2004
Algorithms for enumerating circuits in matroids. Zbl 1205.05038
Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Khachiyan, Leonid
3
2003
Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices. Zbl 1160.05325
Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Khachiyan, Leonid
3
2003
Transversal hypergraphs and families of polyhedral cones. Zbl 0989.68059
Khachiyan, Leonid
3
2001
An interior point method for bordered block-diagonal linear programs. Zbl 0868.90077
Grigoriadis, Michael D.; Khachiyan, Leonid G.
3
1996
Diagonal matrix scaling is NP-hard. Zbl 0840.65030
Khachiyan, Leonid
3
1996
The problem of computing the volume of a polyhedron is # P-hard. Zbl 0676.68016
Khachiyan, L. G.
3
1989
Problems of optimal algorithms in convex programming, decomposition and sorting. Zbl 0791.90044
Khachiyan, L. G.
3
1989
Convexity and complexity in polynomial programming. Zbl 0588.90070
Khachiyan, L. G.
3
1984
Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions. Zbl 1160.68018
Khachiyan, Leonid; Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir
2
2008
Enumerating spanning and connected subsets in graphs and matroids. Zbl 1160.05313
Khachiyan, Leonid; Boros, Endre; Borys, Konrad; Elbassioni, Khaled; Gurvich, Vladimir; Makino, Kazuhisa
2
2007
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data. Zbl 1115.68105
Khachiyan, Leonid; Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Makino, Kazuhisa
2
2007
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory. Zbl 1110.05050
Khachiyan, Leonid; Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Makino, Kazuhisa
2
2007
Matroid intersections, polymatroid inequalities, and related problems. Zbl 1016.05022
Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Khachiyan, Leonid
2
2002
Testing the feasibility of semidefinite programs. Zbl 0906.90123
Porkolab, Lorant; Khachiyan, Leonid
2
1998
On the exact solution of systems of linear inequalities and linear programming problems. Zbl 0518.90059
Khachiyan, L. G.
2
1982
Bounds of solutions and algorithmic complexity of systems of convex Diophantine inequalities. Zbl 0467.90048
Tarasov, S. P.; Khachiyan, L. G.
2
1980
Convergence rate of the game processes for solving matrix games. Zbl 0395.90048
Khachiyan, L. G.
2
1977
Selected works. Zbl 1261.01016
Khachiyan, Leonid G.
1
2009
Generating all minimal integral solutions to monotone \(\wedge,\vee\)-systems of linear, transversal and polymatroid inequalities. Zbl 1156.68403
Khachiyan, L.; Boros, E.; Elbassioni, K.; Gurvich, V.
1
2005
An interactive procedure based on the inscribed ellipsoid method. Zbl 0705.90076
Alekseev, A. V.; Erlikh, I. I.; Khachiyan, L. G.
1
1990
An inequality for the volume of inscribed ellipsoids. Zbl 0694.52006
Khachiyan, L. G.
1
1990
A certain inequality for convex forms. Zbl 0662.90063
Tarasov, S. P.; Khachiyan, L. G.
1
1987
Use of pseudo-polynomial algorithms for some problems of combinatorial optimization with constraints. Zbl 0654.90071
Smetanin, Yu. G.; Khachiyan, L. G.
1
1987
Polynomial solvability of convex diophantine programming problems with a fixed number of variables. Zbl 0576.90068
Khachiyan, L. G.
1
1983
Convexity and algorithmic complexity of the solutions of polynomial programming problems. Zbl 0527.90076
Khachiyan, L. G.
1
1982
On the convergence of iterative game processes with non-equal choice of steps for the partners. Zbl 0413.90085
Khachiyan, L. G.; Ehrlikh, A. I.
1
1978
Serial game processes for solving convex programs. Zbl 0401.90111
Khachiyan, L. G.; Èrlikh, A. I.
1
1978
On the rate of convergence of game processes for the solution of matrix games. Zbl 0402.90062
Khachiyan, L. G.
1
1977
Selected works. Zbl 1261.01016
Khachiyan, Leonid G.
1
2009
Generating all vertices of a polyhedron is hard. Zbl 1147.05040
Khachiyan, Leonid; Boros, Endre; Borys, Konrad; Elbassioni, Khaled; Gurvich, Vladimir
24
2008
Generating cut conjunctions in graphs and related problems. Zbl 1147.68060
Khachiyan, Leonid; Boros, Endre; Borys, Konrad; Elbassioni, Khaled; Gurvich, Vladimir; Makino, Kazuhisa
3
2008
Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions. Zbl 1160.68018
Khachiyan, Leonid; Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir
2
2008
A global parallel algorithm for the hypergraph transversal problem. Zbl 1185.68838
Khachiyan, Leonid; Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir
10
2007
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs. Zbl 1125.68088
Khachiyan, Leonid; Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir
5
2007
Enumerating spanning and connected subsets in graphs and matroids. Zbl 1160.05313
Khachiyan, Leonid; Boros, Endre; Borys, Konrad; Elbassioni, Khaled; Gurvich, Vladimir; Makino, Kazuhisa
2
2007
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data. Zbl 1115.68105
Khachiyan, Leonid; Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Makino, Kazuhisa
2
2007
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory. Zbl 1110.05050
Khachiyan, Leonid; Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Makino, Kazuhisa
2
2007
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation. Zbl 1110.68104
Khachiyan, Leonid; Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir
18
2006
On the complexity of some enumeration problems for matroids. Zbl 1104.05017
Khachiyan, L.; Boros, E.; Elbassioni, K.; Gurvich, V.; Makino, K.
17
2006
Extending Dijkstra’s algorithm to maximize the shortest path by node-wise limited arc interdiction. Zbl 1185.90198
Khachiyan, Leonid; Gurvich, Vladimir; Zhao, Jihui
7
2006
Generating all vertices of a polyhedron is hard. Zbl 1192.52022
Khachiyan, Leonid; Boros, Endre; Borys, Konrad; Elbassioni, Khaled; Gurvich, Vladimir
5
2006
Enumerating spanning and connected subsets in graphs and matroids. Zbl 1131.05305
Khachiyan, L.; Boros, E.; Borys, K.; Elbassioni, K.; Gurvich, V.; Makino, K.
3
2006
A new algorithm for the hypergraph transversal problem. Zbl 1128.05306
Khachiyan, Leonid; Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir
7
2005
Generating cut conjunctions and bridge avoiding extensions in graphs. Zbl 1147.68609
Khachiyan, L.; Boros, E.; Borys, K.; Elbassioni, K.; Gurvich, V.; Makino, K.
4
2005
Generating all minimal integral solutions to monotone \(\wedge,\vee\)-systems of linear, transversal and polymatroid inequalities. Zbl 1156.68403
Khachiyan, L.; Boros, E.; Elbassioni, K.; Gurvich, V.
1
2005
Generating maximal independent sets for hypergraphs with bounded edge-intersections. Zbl 1196.05057
Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Khachiyan, Leonid
20
2004
Enumerating minimal dicuts and strongly connected subgraphs and related geometric problems. Zbl 1092.68074
Boros, E.; Elbassioni, K.; Gurvich, V.; Khachiyan, L.
7
2004
Dual-bounded generating problems: Weighted transversals of a hypergraph. Zbl 1062.68083
Boros, E.; Gurvich, V. A.; Khachiyan, L.; Makino, K.
6
2004
Generating paths and cuts in multi-pole (di)graphs. Zbl 1096.68117
Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Khachiyan, Leonid; Makino, Kazuhisa
3
2004
On maximal frequent and minimal infrequent sets in binary matrices. Zbl 1038.68041
Boros, E.; Gurvich, V.; Khachiyan, L.; Makino, K.
10
2003
An intersection inequality for discrete distributions and related generation problems. Zbl 1060.90691
Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Khachiyan, Leonid; Makino, Kazuhisa
8
2003
An inequality for polymatroid functions and its applications. Zbl 1033.05023
Boros, E.; Elbassioni, K.; Gurvich, V.; Khachiyan, L.
7
2003
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals. Zbl 1266.68199
Boros, E.; Elbassioni, K.; Gurvich, V.; Khachiyan, Leonid
4
2003
Algorithms for enumerating circuits in matroids. Zbl 1205.05038
Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Khachiyan, Leonid
3
2003
Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices. Zbl 1160.05325
Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Khachiyan, Leonid
3
2003
Dual-bounded generating problems: All minimal integer solutions for a monotone system of linear inequalities. Zbl 1041.68064
Boros, E.; Elbassioni, K.; Gurvich, V.; Khachiyan, L.; Makino, K.
22
2002
On the complexity of generating maximal frequent and minimal infrequent sets. Zbl 1054.68072
Boros, E.; Gurvich, V.; Khachiyan, L.; Makino, K.
17
2002
Generating dual-bounded hypergraphs. Zbl 1065.05066
Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Khachiyan, Leonid
6
2002
Matroid intersections, polymatroid inequalities, and related problems. Zbl 1016.05022
Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Khachiyan, Leonid
2
2002
Approximate max-min resource sharing for structured concave optimization. Zbl 1010.90060
Grigoriadis, M. D.; Khachiyan, L. G.; Porkolab, L.; Villavicencio, J.
15
2001
Dual-bounded generating problems: Partial and multiple transversals of a hypergraph. Zbl 0980.68077
Boros, Endre; Gurvich, Vladimir; Khachiyan, Leonid; Makino, Kazuhisa
15
2001
On generating all minimal integer solutions for a monotone system of linear inequalities. Zbl 0986.90024
Boros, E.; Elbassioni, K.; Gurvich, V.; Khachiyan, L.; Makino, K.
4
2001
Transversal hypergraphs and families of polyhedral cones. Zbl 0989.68059
Khachiyan, Leonid
3
2001
Integer optimization on convex semialgebraic sets. Zbl 0966.90059
Khachiyan, L.; Porkolab, L.
13
2000
Generating partial and multiple transversals of a hypergraph. Zbl 0973.68182
Boros, Endre; Gurvich, Vladimir; Khachiyan, Leonid; Makino, Kazuhisa
5
2000
On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions. Zbl 0953.06013
Gurvich, V.; Khachiyan, L.
29
1999
Approximating fixed points of weakly contracting mappings. Zbl 0948.65055
Huang, Z.; Khachiyan, L.; Sikorski, K.
8
1999
Testing the feasibility of semidefinite programs. Zbl 0906.90123
Porkolab, Lorant; Khachiyan, Leonid
2
1998
On the complexity of semidefinite programs. Zbl 0881.90127
Porkolab, Lorant; Khachiyan, Leonid
19
1997
On the frequency of the most frequently occurring variable in dual monotone DNFs. Zbl 0872.06012
Gurvich, Vladimir; Khachiyan, Leonid
5
1997
On the complexity of matrix balancing. Zbl 0882.65031
Kalantari, B.; Khachiyan, L.; Shokoufandeh, A.
5
1997
On the complexity of dualization of monotone disjunctive normal forms. Zbl 0864.68038
Fredman, Michael L.; Khachiyan, Leonid
104
1996
Rounding of polytopes in the real number model of computation. Zbl 0856.68066
Khachiyan, Leonid G.
29
1996
Coordination complexity of parallel price-directive decomposition. Zbl 0857.90100
Grigoriadis, Michael D.; Khachiyan, Leonid G.
23
1996
On the complexity of nonnegative-matrix scaling. Zbl 0849.15003
Kalantari, Bahman; Khachiyan, Leonid
13
1996
Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time. Zbl 0874.90085
Grigoriadis, Michael D.; Khachiyan, Leonid G.
6
1996
An interior point method for bordered block-diagonal linear programs. Zbl 0868.90077
Grigoriadis, Michael D.; Khachiyan, Leonid G.
3
1996
Diagonal matrix scaling is NP-hard. Zbl 0840.65030
Khachiyan, Leonid
3
1996
A sublinear-time randomized approximation algorithm for matrix games. Zbl 0857.90144
Grigoriadis, Michael D.; Khachiyan, Leonid G.
21
1995
On the complexity of approximating extremal determinants in matrices. Zbl 0819.65085
Khachiyan, Leonid
9
1995
An exponential-function reduction method for block-angular convex programs. Zbl 0856.90089
Grigoriadis, Michael D.; Khachiyan, Leonid G.
5
1995
Fast approximation schemes for convex programs with many blocks and coupling constraints. Zbl 0808.90105
Grigoriadis, Michael D.; Khachiyan, Leonid G.
18
1994
On the complexity of approximating the maximal inscribed ellipsoid for a polytope. Zbl 0792.90088
Khachiyan, Leonid G.; Todd, Michael J.
34
1993
A greedy heuristic for a minimum-weight forest problem. Zbl 0804.90124
Imielińska, Celina; Kalantari, Bahman; Khachiyan, Leonid
13
1993
Complexity of polytope volume computation. Zbl 0789.52016
Khachiyan, Leonid
9
1993
On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms. Zbl 0795.65022
Kalantari, Bahman; Khachiyan, Leonid
7
1993
Diagonal matrix scaling and linear programming. Zbl 0770.90043
Khachiyan, Leonid; Kalantari, Bahman
14
1992
Approximate solution of matrix games in parallel. Zbl 0814.90134
Grigoriadis, Michael D.; Khachiyan, Leonid G.
5
1992
On the conductance of order Markov chains. Zbl 0736.06002
Karzanov, Alexander; Khachiyan, Leonid
21
1991
An interactive procedure based on the inscribed ellipsoid method. Zbl 0705.90076
Alekseev, A. V.; Erlikh, I. I.; Khachiyan, L. G.
1
1990
An inequality for the volume of inscribed ellipsoids. Zbl 0694.52006
Khachiyan, L. G.
1
1990
The problem of calculating the volume of a polyhedron is enumerably hard. Zbl 0692.68034
Khachiyan, L. G.
13
1989
The problem of computing the volume of a polyhedron is # P-hard. Zbl 0676.68016
Khachiyan, L. G.
3
1989
Problems of optimal algorithms in convex programming, decomposition and sorting. Zbl 0791.90044
Khachiyan, L. G.
3
1989
Cyclic games and an algorithm to find minimax cycle means in directed graphs. Zbl 0695.90105
Gurvich, V. A.; Karzanov, A. V.; Khachiyan, L. G.
42
1988
The method of inscribed ellipsoids. Zbl 0685.90077
Tarasov, S. P.; Khachiyan, L. G.; Ehrlikh, I. I.
21
1988
Cyclic games and determination of minimax mean cycles in digraphs. Zbl 0661.90108
Gurvich, V. A.; Karzanov, A. V.; Khachiyan, L. G.
8
1988
A certain inequality for convex forms. Zbl 0662.90063
Tarasov, S. P.; Khachiyan, L. G.
1
1987
Use of pseudo-polynomial algorithms for some problems of combinatorial optimization with constraints. Zbl 0654.90071
Smetanin, Yu. G.; Khachiyan, L. G.
1
1987
Convexity and complexity in polynomial programming. Zbl 0588.90070
Khachiyan, L. G.
3
1984
Polynomial solvability of convex diophantine programming problems with a fixed number of variables. Zbl 0576.90068
Khachiyan, L. G.
1
1983
On the exact solution of systems of linear inequalities and linear programming problems. Zbl 0518.90059
Khachiyan, L. G.
2
1982
Convexity and algorithmic complexity of the solutions of polynomial programming problems. Zbl 0527.90076
Khachiyan, L. G.
1
1982
Polynomial algorithms in linear programming. Zbl 0459.90047
Khachiyan, L. G.
69
1980
The polynomial solvability of convex quadratic programming. Zbl 0486.90068
Kozlov, M. K.; Tarasov, S. P.; Khachiyan, L. G.
18
1980
Polynomial algorithms in linear programming. Zbl 0431.90043
Khachiyan, L. G.
11
1980
Bounds of solutions and algorithmic complexity of systems of convex Diophantine inequalities. Zbl 0467.90048
Tarasov, S. P.; Khachiyan, L. G.
2
1980
A polynomial algorithm in linear programming. Zbl 0414.90086
Khachiyan, L. G.
257
1979
A polynomial algorithm in linear programming. Zbl 0409.90079
Hačijan, L. G.
99
1979
Polynomial solvability of convex quadratic programming. Zbl 0434.90071
Kozlov, M. K.; Tarasov, S. P.; Khachiyan, L. G.
43
1979
On the convergence of iterative game processes with non-equal choice of steps for the partners. Zbl 0413.90085
Khachiyan, L. G.; Ehrlikh, A. I.
1
1978
Serial game processes for solving convex programs. Zbl 0401.90111
Khachiyan, L. G.; Èrlikh, A. I.
1
1978
Convergence rate of the game processes for solving matrix games. Zbl 0395.90048
Khachiyan, L. G.
2
1977
On the rate of convergence of game processes for the solution of matrix games. Zbl 0402.90062
Khachiyan, L. G.
1
1977
all top 5

Cited by 1,385 Authors

38 Elbassioni, Khaled M.
37 Gurvich, Vladimir A.
33 Boros, Endre
31 Makino, Kazuhisa
22 Khachiyan, Leonid Genrikhovich
12 Jansen, Klaus
11 Kalantari, Bahman
11 Ye, Yinyu
8 Ibaraki, Toshihide
8 Nemirovski, Arkadi S.
8 Terlaky, Tamás
8 Todd, Michael J.
7 Chatterjee, Krishnendu
7 Dyukova, Elena Vsevolodovna
7 Eirinakis, Pavlos
7 Pardalos, Panos M.
7 Sergienko, Ivan Vasylyovych
6 Gaubert, Stéphane
6 Golovach, Petr A.
6 Gribanov, Dmitry V.
6 Gritzmann, Peter
6 Malyshev, Dmitry S.
6 Subramani, Krishnan
6 Tiwary, Hans Raj
6 Veselov, Sergeĭ Ivanovich
6 Wojciechowski, Piotr J.
5 Adler, Ilan
5 De Loera, Jesús A.
5 Freund, Robert M.
5 Kanté, Mamadou Moustapha
5 Klee, Victor LaRue
5 Lebedev, Vasiliĭ N.
5 Mary, Arnaud
5 Nesterov, Yurii
5 Nourine, Lhouari
5 Papadimitriou, Christos Harilaos
5 Primak, Mordukh E.
5 Serna, Maria José
5 Sikorski, Krzysztof A.
5 Uno, Takeaki
4 Allamigeon, Xavier
4 Barvinok, Alexander I.
4 Błażewicz, Jacek
4 Borys, Konrad
4 Chandrasekaran, Ramaswamy
4 de Klerk, Etienne
4 Del Pia, Alberto
4 Eiter, Thomas
4 Goldfarb, Donald
4 Joswig, Michael
4 Katz, Ricardo David
4 Kavvadias, Dimitris J.
4 Kern, Walter
4 Kratsch, Dieter
4 Prékopa, András
4 Rauf, Imran
4 Sen, Syamal Kumar
4 Shor, Naum Zuselevich
4 Spirakis, Paul G.
4 Vavasis, Stephen A.
4 Vorobyov, Sergei
4 Weismantel, Robert
4 Yildirim, Emre Alper
3 Ahipaşaoğlu, Selin Damla
3 Benerecetti, Massimo
3 Biró, Peter
3 Björklund, Henrik
3 Brightwell, Graham R.
3 Burer, Samuel
3 Chirkov, Aleksandr Yu.
3 Chong, Edwin Kah Pin
3 Chubanov, Sergei
3 Conitzer, Vincent
3 Daskalakis, Constantinos
3 Dell’Erba, Daniele
3 Doyen, Laurent
3 Gärtner, Bernd
3 Golumbic, Martin Charles
3 Grigor’ev, Dmitriĭ Yur’evich
3 Hagen, Matthias
3 Heggernes, Pinar
3 Huber, Mark L.
3 Karzanov, Aleksandr V.
3 Kuznetsov, Sergei O.
3 Laszlo, Michael J.
3 Lenstra, Jan Karel
3 Lin, Jyh-Han
3 Liu, Yajing
3 Loho, Georg
3 Lovász, László
3 Mastrolilli, Monaldo
3 Matoušek, Jiří
3 Megiddo, Nimrod
3 Mehlhorn, Kurt
3 Mintz, Aviad
3 Mogavero, Fabio
3 Molinero, Xavier
3 Mukherjee, Sumitra
3 Nagamochi, Hiroshi
3 Naldi, Simone
...and 1,285 more Authors
all top 5

Cited in 188 Serials

73 Discrete Applied Mathematics
67 Mathematical Programming. Series A. Series B
47 Theoretical Computer Science
37 European Journal of Operational Research
24 Algorithmica
24 Linear Algebra and its Applications
21 Discrete Mathematics
21 Operations Research Letters
19 Information Processing Letters
16 Annals of Operations Research
15 Discrete & Computational Geometry
14 Optimization Letters
12 Artificial Intelligence
12 Information and Computation
12 Journal of Combinatorial Optimization
11 Mathematical Programming
10 Journal of Computer and System Sciences
10 Journal of Optimization Theory and Applications
10 Computers & Operations Research
10 SIAM Journal on Discrete Mathematics
10 Computational Optimization and Applications
9 Applied Mathematics and Computation
9 Journal of Complexity
9 Journal of Global Optimization
9 Optimization Methods & Software
8 Journal of Symbolic Computation
8 Games and Economic Behavior
8 Computational Mathematics and Mathematical Physics
7 Fuzzy Sets and Systems
7 SIAM Journal on Computing
7 Optimization
7 Cybernetics and Systems Analysis
7 Mathematical Methods of Operations Research
6 Automatica
6 Mathematics of Operations Research
6 Mathematical Social Sciences
6 Computational Geometry
6 SIAM Journal on Optimization
6 Annals of Mathematics and Artificial Intelligence
6 Discrete Optimization
5 Cybernetics
5 European Journal of Combinatorics
5 Combinatorica
5 Theory of Computing Systems
4 Mathematics of Computation
4 Operations Research
4 Order
4 Journal of Automated Reasoning
4 Computer Science Review
3 Acta Informatica
3 Journal of Soviet Mathematics
3 SIAM Journal on Algebraic and Discrete Methods
3 Applied Numerical Mathematics
3 Acta Mathematicae Applicatae Sinica. English Series
3 International Journal of Approximate Reasoning
3 Applied Mathematics Letters
3 Machine Learning
3 Automation and Remote Control
3 Bulletin of the American Mathematical Society. New Series
3 Journal of Computer and Systems Sciences International
3 Constraints
3 European Journal of Control
3 Foundations of Computational Mathematics
3 Journal of Discrete Algorithms
3 Prikladnaya Diskretnaya Matematika
2 Computers & Mathematics with Applications
2 Journal of Mathematical Analysis and Applications
2 Mathematical Notes
2 Information Sciences
2 International Journal of Game Theory
2 Journal of Combinatorial Theory. Series A
2 Journal of Computational and Applied Mathematics
2 Journal of Statistical Planning and Inference
2 Siberian Mathematical Journal
2 Advances in Applied Mathematics
2 Asia-Pacific Journal of Operational Research
2 Journal of Economic Dynamics & Control
2 Mathematical and Computer Modelling
2 Real-Time Systems
2 Random Structures & Algorithms
2 Neural Computation
2 International Journal of Algebra and Computation
2 International Journal of Foundations of Computer Science
2 Zeitschrift für Operations Research. Serie A: Theorie
2 Proceedings of the Indian Academy of Sciences. Mathematical Sciences
2 Journal of Algebraic Combinatorics
2 Formal Methods in System Design
2 Economic Theory
2 Mathematical Problems in Engineering
2 RAIRO. Operations Research
2 Journal of Applied Mathematics
2 Fuzzy Optimization and Decision Making
2 Computational Management Science
2 Logical Methods in Computer Science
2 Mathematical Programming Computation
2 Statistics and Computing
1 Communications in Mathematical Physics
1 Communications on Pure and Applied Mathematics
1 International Journal of Mathematical Education in Science and Technology
1 Journal of Fluid Mechanics
...and 88 more Serials
all top 5

Cited in 42 Fields

496 Operations research, mathematical programming (90-XX)
348 Computer science (68-XX)
124 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
121 Combinatorics (05-XX)
120 Numerical analysis (65-XX)
62 Convex and discrete geometry (52-XX)
38 Linear and multilinear algebra; matrix theory (15-XX)
36 Order, lattices, ordered algebraic structures (06-XX)
30 Information and communication theory, circuits (94-XX)
29 Mathematical logic and foundations (03-XX)
27 Statistics (62-XX)
18 Calculus of variations and optimal control; optimization (49-XX)
16 Algebraic geometry (14-XX)
14 Systems theory; control (93-XX)
12 Biology and other natural sciences (92-XX)
11 Probability theory and stochastic processes (60-XX)
9 Number theory (11-XX)
8 History and biography (01-XX)
6 Commutative algebra (13-XX)
5 Operator theory (47-XX)
4 Approximations and expansions (41-XX)
4 Manifolds and cell complexes (57-XX)
4 Quantum theory (81-XX)
3 General and overarching topics; collections (00-XX)
3 Functional analysis (46-XX)
3 Geometry (51-XX)
2 Group theory and generalizations (20-XX)
2 Real functions (26-XX)
2 Measure and integration (28-XX)
2 Harmonic analysis on Euclidean spaces (42-XX)
2 Algebraic topology (55-XX)
1 General algebraic systems (08-XX)
1 Field theory and polynomials (12-XX)
1 Associative rings and algebras (16-XX)
1 Nonassociative rings and algebras (17-XX)
1 Topological groups, Lie groups (22-XX)
1 Ordinary differential equations (34-XX)
1 Dynamical systems and ergodic theory (37-XX)
1 General topology (54-XX)
1 Fluid mechanics (76-XX)
1 Classical thermodynamics, heat transfer (80-XX)
1 Geophysics (86-XX)

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.