scientific article
From MaRDI portal
Publication:4051879
zbMath0297.90047MaRDI QIDQ4051879
Publication date: 1972
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Linear programming (90C05) Linear inequalities of matrices (15A39) Inequalities and extremum problems involving convexity in convex geometry (52A40) Polytopes and polyhedra (52Bxx)
Related Items (only showing first 100 items - show all)
On the length of simplex paths: The assignment case ⋮ Geometric random edge ⋮ Complexity of some parametric integer and network programming problems ⋮ A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs ⋮ The Klee–Minty random edge chain moves with linear speed ⋮ Tropicalizing the Simplex Algorithm ⋮ From Parity and Payoff Games to Linear Programming ⋮ A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities ⋮ Affirmative action algorithms ⋮ Fuzzy facility location-allocation problem under the Hurwicz criterion ⋮ Simplex method and groups generated by reflections ⋮ Pivoting in linear complementarity: Two polynomial-time cases ⋮ A simple direct cosine simplex algorithm ⋮ Smoothing the Gap Between NP and ER ⋮ Computing convex hulls and counting integer points with \texttt{polymake} ⋮ The Efficiency of an Algorithm of Integer Programming: A Probabilistic Analysis ⋮ On the Number of Solutions Generated by the Simplex Method for LP ⋮ An exponential lower bound for Zadeh's pivot rule ⋮ Globally Adaptive Longitudinal Quantile Regression With High Dimensional Compositional Covariates ⋮ The Polyhedral Geometry of Pivot Rules and Monotone Paths ⋮ Inapproximability of shortest paths on perfect matching polytopes ⋮ Minkowski summands of cubes ⋮ Unnamed Item ⋮ Nonparametric density estimation with nonuniform B-spline bases ⋮ Facility location-allocation problem in random fuzzy environment: using \((\alpha,\beta )\)-cost minimization model under the Hurewicz criterion ⋮ Inference for High-Dimensional Censored Quantile Regression ⋮ The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs ⋮ The octatope abstract domain for verification of neural networks ⋮ A Friendly Smoothed Analysis of the Simplex Method ⋮ Constraint Satisfaction Problems over Numeric Domains ⋮ Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery ⋮ A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games ⋮ How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds ⋮ The complexity of linear programming ⋮ New results on the average behavior of simplex algorithms ⋮ On the average number of steps of the simplex method of linear programming ⋮ Incremental convex hull algorithms are not output sensitive ⋮ Computational complexity of LCPs associated with positive definite symmetric matrices ⋮ Random edge can be exponential on abstract cubes ⋮ Unnamed Item ⋮ Finite convergence of an active signature method to local minima of piecewise linear functions ⋮ Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization ⋮ Minkowski summands of cubes ⋮ Unnamed Item ⋮ The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential ⋮ A parallel approach for determining confidence intervals of variable statistics in large and sparse linear equations with RHS ranges ⋮ Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm ⋮ Vector Space Decomposition for Solving Large-Scale Linear Programs ⋮ Low order polynomial bounds on the expected performance of local improvement algorithms ⋮ Graphs and Algorithms in Communication Networks on Seven League Boots ⋮ The simplex algorithm with the pivot rule of maximizing criterion improvement ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Fast Algorithms for Rank-1 Bimatrix Games ⋮ Novel solutions on model-based and model-free robotic-assisted ankle rehabilitation ⋮ Unnamed Item ⋮ Modifications and implementation of the ellipsoid algorithm for linear programming ⋮ A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method ⋮ On the computational complexity of piecewise-linear homotopy algorithms ⋮ On the Length of Monotone Paths in Polyhedra ⋮ Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow ⋮ A Portable Parallel Implementation of the lrs Vertex Enumeration Code ⋮ Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization ⋮ A Simple Algorithm for Finding a Non-negative Basic Solution of a System of Linear Algebraic Equations ⋮ Trivial integer programs unsolvable by branch-and-bound ⋮ Random polytopes: Their definition, generation and aggregate properties ⋮ Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis ⋮ Solving Basis Pursuit ⋮ A bad network problem for the simplex method and other minimum cost flow algorithms ⋮ On the lexicographic centre of multiple objective optimization ⋮ Blending simple polytopes at faces ⋮ Deciding probabilistic automata weak bisimulation: theory and practice ⋮ Methods for a network design problem in solar power systems ⋮ Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs ⋮ On the complexity of some basic problems in computational convexity. I. Containment problems ⋮ Cascading-heuristics for the solution of staircase linear programs ⋮ Recognizing one-dimensional Euclidean preference profiles ⋮ A new family of exponential LP problems ⋮ Computing equilibria: a computational complexity perspective ⋮ Construction and analysis of projected deformed products ⋮ A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps ⋮ A multiplicative barrier function method for linear programming ⋮ How good are convex hull algorithms? ⋮ Completely unimodal numberings of a simple polytope ⋮ Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods ⋮ An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming ⋮ Linear programming, the simplex algorithm and simple polytopes ⋮ Criss-cross methods: A fresh view on pivot algorithms ⋮ Some LCPs solvable in strongly polynomial time with Lemke's algorithm ⋮ Combinatorial redundancy detection ⋮ On the number of iterations of local improvement algorithms ⋮ Resolution of the problem of degeneracy in a primal and dual simplex algorithm ⋮ Models of opinion control for agents in social networks ⋮ Implementing the simplex method as a cutting-plane method, with a view to regularization ⋮ A simplex algorithm for a class of Leontief flow problems ⋮ A polynomial arc-search interior-point algorithm for linear programming ⋮ A subexponential bound for linear programming ⋮ Reformulation of the linear program for completely ergodic MDPs with average cost criteria ⋮ Worst case behavior of the steepest edge simplex method ⋮ Abstract tropical linear programming ⋮ Observations on a class of nasty linear complementarity problems
This page was built for publication:
