scientific article

From MaRDI portal
Revision as of 21:43, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3050157

zbMath0414.90086MaRDI QIDQ3050157

Leonid G. Khachiyan

Publication date: 1979


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (only showing first 100 items - show all)

A 71/60 theorem for bin packingHomotopy techniques in linear programmingKarmarkar's algorithm and the ellipsoid methodKBO orientabilityComputing a quasi-perfect equilibrium of a two-player gameComputing equilibria: a computational complexity perspectiveScheduling jobs with fixed start and end timesA multiplicative barrier function method for linear programmingSingle-projection procedure for linear optimizationProbabilistic satisfiabilityBinary classification posed as a quadratically constrained quadratic programming and solved using particle swarm optimizationNew trends in machine schedulingFixed interval scheduling: models, applications, computational complexity and algorithmsA relaxed version of Karmarkar's methodA polynomial-time algorithm, based on Newton's method, for linear programmingThe complexity of recognizing polyhedral scenesEliminating columns in the simplex method for linear programmingMinimal ellipsoids and their dualsAn extension of Karmarkar's projective algorithm for convex quadratic programmingThe Boolean quadratic polytope: Some characteristics, facets and relativesSubspaces with well-scaled framesA polynomial-time algorithm for a class of linear complementarity problemsA polynomial arc-search interior-point algorithm for linear programmingThe Perceptron algorithm versus Winnow: linear versus logarithmic mistake bounds when few input variables are relevantA brief history of the international symposia on mathematical programmingA note on Khatchian's algorithmOn the complexity of quantified linear systemsAn iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problemSmoothed analysis of condition numbers and complexity implications for linear programming\((k,j)\)-coloring of sparse graphsForms of representation for simple games: sizes, conversions and equivalencesCoping with selfish on-going behaviorsSelectivity in probabilistic causality: where psychology runs into quantum physicsPositive diagonal scaling of a nonnegative tensor to one with prescribed slice sumsMultiobjective network scheduling with efficient use of renewable and nonrenewable resourcesTwo complexity results on \(c\)-optimality in experimental designGeometric complexity theory. III: On deciding nonvanishing of a Littlewood-Richardson coefficientInterior point methods 25 years laterA ``build-down scheme for linear programmingSequential virtual motion camouflage method for nonlinear constrained optimal trajectory controlA counterexample to the Hirsch conjectureAn algorithm for linear programming that is easy to implementIs binary encoding appropriate for the problem-language relationship?On the combinatorial problems which I would most like to see solvedThe ellipsoid method and its consequences in combinatorial optimizationSolving linear programs from sign patternsAn appraisal of computational complexity for operations researchersComplexity of computations in Commutative Division of the USSR Academy of SciencesA class of linear complementarity problems solvable in polynomial timeOn the complexity of generalized due date scheduling problemsCorrelation polytopes: Their geometry and complexitySimple search methods for finding a Nash equilibriumSemidefinite programming for min-max problems and gamesCompact systems for T-join and perfect matching polyhedra of graphs with bounded genusAn analytical comparison of different formulations of the travelling salesman problemA complexity perspective on entailment of parameterized linear constraintsTemporal constraint networksThe complexity of problems involving structurally bounded and conservative Petri netsThe complexity of optimizing over a simplex, hypercube or sphere: a short surveyA simpler and tighter redundant Klee-Minty constructionOn the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the realsA canonical form for generalized linear constraintsLearning in parallelThe complexity of stochastic gamesGeorge B. Dantzig and systems optimizationGeorge Dantzig's impact on the theory of computationAnalyzing restricted fragments of the theory of linear arithmeticThe double pivot simplex methodPolynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matricesA combinatorial certifying algorithm for linear feasibility in UTVPI constraintsSparse approximate solution of partial differential equationsA strongly polynomial algorithm for linear systems having a binary solutionScheduling ordered open shopsGraph theory (algorithmic, algebraic, and metric problems)Some lower bounds for the complexity of the linear programming feasibility problem over the realsOpen problems in computational linear algebraA redundant Klee-Minty construction with all the redundant constraints touching the feasible regionApproximated consistency for the automatic recording constraintA polynomial projection algorithm for linear feasibility problemsMultiline addressing by network flowThe \(C^m\) norm of a function with prescribed jets. IIInteractive multiple objective optimization: Survey. I: Continuous caseMulticommodity flows in certain planar directed networksA new polynomial-time algorithm for linear programmingVariations on a theme by Akl and Taylor: security and tradeoffsScl in graphs of groupsLinear programming under randomness and fuzzinessPreemptive scheduling of independent jobs on parallel machines subject to financial constraintsThe vertices of the knapsack polytopeThreshold hypergraphsCombinatorial analysis (nonnegative matrices, algorithmic problems)The complexity of facets (and some facets of complexity)Solving systems of polynomial inequalities over a real closed field in subexponential timeInterior-point algorithms for global optimizationA quadratically convergent method for linear programmingMathematical programming formulations for machine scheduling: A surveyIntelligent gradient search in linear programmingUpdating beliefs with incomplete observationsSmall solutions of linear diophantine equationsGeneration of interior points and polyhedral representations of cones in \(\mathbb R^N\) cut by \(M\) planes sharing a common point







This page was built for publication: