scientific article; zbMATH DE number 3466805
From MaRDI portal
Publication:4051879
Cited in
(only showing first 100 items - show all)- A redundant Klee-Minty construction with all the redundant constraints touching the feasible region
- Computing monotone disjoint paths on polytopes
- Intelligent gradient search in linear programming
- Methods for a network design problem in solar power systems
- A new family of exponential LP problems
- A simplex variant solving an m d linear program in O(min(m 2,d 2)) expected number of pivot steps
- A multiplicative barrier function method for linear programming
- Completely unimodal numberings of a simple polytope
- Worst case behavior of the steepest edge simplex method
- Observations on a class of nasty linear complementarity problems
- Discrete extremal problems
- A new linear programming algorithm - better or worse than the simplex method?
- On relaxation methods for systems of linear inequalities
- A simple heuristic approach to simplex efficiency
- An appraisal of computational complexity for operations researchers
- Upper bounds for the diameter and height of graphs of convex polyhedra
- Paths on polymatroids
- Recurrent neural networks for linear programming: Analysis and design principles
- Polytope pairs and their relationship to linear programming
- Efficient search for rationals
- Pivot rules for linear programming: A survey on recent theoretical developments
- An exterior point simplex algorithm for (general) linear programming problems
- On the complexity of some basic problems in computational convexity. I. Containment problems
- How good are convex hull algorithms?
- Linear programming, the simplex algorithm and simple polytopes
- Criss-cross methods: A fresh view on pivot algorithms
- Resolution of the problem of degeneracy in a primal and dual simplex algorithm
- A simplex algorithm for a class of Leontief flow problems
- Generic-case complexity, decision problems in group theory, and random walks.
- Symbiosis between linear algebra and optimization
- Pivot versus interior point methods: Pros and cons
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
- Combinatorial redundancy detection
- Reformulation of the linear program for completely ergodic MDPs with average cost criteria
- Reduction techniques for network validation in systems biology
- An efficient simplex type algorithm for sparse and dense linear programs.
- Fast finite methods for a system of linear inequalities
- Blending simple polytopes at faces
- Cascading-heuristics for the solution of staircase linear programs
- A subexponential bound for linear programming
- A bound for the number of different basic solutions generated by the simplex method
- A two-phase support method for solving linear programs: numerical experiments
- Subpolytopes of cyclic polytopes
- Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
- Two curve Chebyshev approximation and its application to signal clustering
- Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem
- An interior-point algorithm for linear programming with optimal selection of centering parameter and step size
- Fast quantum subroutines for the simplex method
- Values for level structures with polynomial-time algorithms, relevant coalition functions, and general considerations
- Reinforcement learning of simplex pivot rules: a proof of concept
- Abstract tropical linear programming
- A double-pivot simplex algorithm and its upper bounds of the iteration numbers
- A note on the complexity of an algorithm for Chebyshev approximation
- Klee-Minty's LP and upper bounds for Dantzig's simplex method
- Steepest-edge rule and its number of simplex iterations for a nondegenerate LP
- A space decomposition-based deterministic algorithm for solving linear optimization problems
- A note on the distribution of the number of simplex iterations to optimality
- A characterization theorem and an algorithm for a convex hull problem
- Geometric random edge
- A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
- Fuzzy facility location-allocation problem under the Hurwicz criterion
- Pivoting in linear complementarity: Two polynomial-time cases
- A simple direct cosine simplex algorithm
- Computing convex hulls and counting integer points with \texttt{polymake}
- Facility location-allocation problem in random fuzzy environment: using \((\alpha,\beta )\)-cost minimization model under the Hurewicz criterion
- How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds
- Random edge can be exponential on abstract cubes
- The simplex algorithm with the pivot rule of maximizing criterion improvement
- A computer implementation of the push-and-pull algorithm and its computational comparison with LP simplex method
- Generation of interior points and polyhedral representations of cones in R^N cut by M planes sharing a common point
- Simplex method and groups generated by reflections
- Minkowski summands of cubes
- On the lexicographic centre of multiple objective optimization
- Deciding probabilistic automata weak bisimulation: theory and practice
- A portable parallel implementation of the \textit{lrs} vertex enumeration code
- On the number of solutions generated by the simplex method for LP
- A subexponential lower bound for Zadeh's pivoting rule for solving linear programs and games
- On the average number of steps of the simplex method of linear programming
- From Parity and Payoff Games to Linear Programming
- New results on the average behavior of simplex algorithms
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods
- Graphs and algorithms in communication networks on seven league boots
- Some LCPs solvable in strongly polynomial time with Lemke's algorithm
- Tropicalizing the simplex algorithm
- A complementary pivot algorithm for market equilibrium under separable, piecewise-linear concave utilities
- A parallel approach for determining confidence intervals of variable statistics in large and sparse linear equations with RHS ranges
- On the length of simplex paths: The assignment case
- Complexity of some parametric integer and network programming problems
- Affirmative action algorithms
- Models of opinion control for agents in social networks
- Implementing the simplex method as a cutting-plane method, with a view to regularization
- Computational complexity of LCPs associated with positive definite symmetric matrices
- The Efficiency of an Algorithm of Integer Programming: A Probabilistic Analysis
- Modifications and implementation of the ellipsoid algorithm for linear programming
- Random polytopes: Their definition, generation and aggregate properties
- Interior point methods 25 years later
- On the number of solutions generated by the dual simplex method
- Recent development in computational complexity characterization of Nash equilibrium
- Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization
- Artificial-free simplex algorithm based on the non-acute constraint relaxation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4051879)
