Computational complexity of parametric linear programming
From MaRDI portal
Cites work
Cited in
(49)- An efficient algorithm for the parametric resource allocation problem
- Complexity of some parametric integer and network programming problems
- An algorithm for approximate multiparametric linear programming
- The inverse-parametric knapsack problem
- A new family of exponential LP problems
- A friendly smoothed analysis of the simplex method
- Combinatorial optimization. Abstracts from the workshop held November 10--15, 2024
- Criss-cross methods: A fresh view on pivot algorithms
- Parametric maximal flows in generalized networks – complexity and algorithms
- On quantified linear implications
- Fast Algorithms for Rank-1 Bimatrix Games
- Parametric computation of minimum-cost flows with piecewise quadratic costs
- New results on the average behavior of simplex algorithms
- Algorithms for flows with parametric capacities
- Graph Clustering in All Parameter Regimes
- Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
- Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization
- Zonotopes with large 2D-cuts
- Unifying known lower bounds via geometric complexity theory
- Parametric mixed-integer 0-1 linear programming: The general case for a single parameter
- The single most vital arc in the most economical path problem -- a parametric analysis
- On linear multiplicative programming.
- A study of piecewise linear-quadratic programs
- A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
- Pivot rules for linear programming: A survey on recent theoretical developments
- Parametric problems on graphs of bounded tree-width
- Applications of the parametric programming procedure
- A geometric view of parametric linear programming
- Facility location-allocation problem in random fuzzy environment: using \((\alpha,\beta )\)-cost minimization model under the Hurewicz criterion
- Upper and lower bounds on the smoothed complexity of the simplex method
- Optimal and efficient adaptation in distributed real-time systems with discrete rates
- A novel parallel combinatorial algorithm for multiparametric programming
- A complexity perspective on entailment of parameterized linear constraints
- Combinatorial geometries representable over GF(3) and GF(q). I: The number of points
- An approximation algorithm for a general class of parametric optimization problems
- An unconditional lower bound for the active-set method on the hypercube
- Exponential lower bounds for many pivot rules for the simplex method
- Unifying lower bounds for algebraic machines, semantically
- A fast parametric assignment algorithm with applications in max-algebra
- Upper and lower bounds on the smoothed complexity of the simplex method
- A unified worst case for classical simplex and policy iteration pivot rules
- Fuzzy facility location-allocation problem under the Hurwicz criterion
- Geometric algorithm for multiparametric linear programming
- A survey of exact and approximation algorithms for linear-parametric optimization problems
- An exterior point simplex algorithm for (general) linear programming problems
- An algorithm for approximate multiparametric convex programming
- Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint
- Geometry of the Gass-Saaty parametric cost LP algorithm
This page was built for publication: Computational complexity of parametric linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3887263)
