Pages that link to "Item:Q3887263"
From MaRDI portal
The following pages link to Computational complexity of parametric linear programming (Q3887263):
Displaying 40 items.
- Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization (Q463718) (← links)
- Optimal and efficient adaptation in distributed real-time systems with discrete rates (Q483961) (← links)
- A complexity perspective on entailment of parameterized linear constraints (Q487646) (← links)
- Geometric algorithm for multiparametric linear programming (Q597202) (← links)
- An algorithm for approximate multiparametric convex programming (Q853676) (← links)
- Combinatorial geometries representable over GF(3) and GF(q). I: The number of points (Q911051) (← links)
- Parametric mixed-integer 0-1 linear programming: The general case for a single parameter (Q958548) (← links)
- Zonotopes with large 2D-cuts (Q1042447) (← links)
- An efficient algorithm for the parametric resource allocation problem (Q1058467) (← links)
- A new family of exponential LP problems (Q1097169) (← links)
- Applications of the parametric programming procedure (Q1179007) (← links)
- A geometric view of parametric linear programming (Q1193520) (← links)
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial (Q1203065) (← links)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
- An exterior point simplex algorithm for (general) linear programming problems (Q1312781) (← links)
- The single most vital arc in the most economical path problem -- a parametric analysis (Q1317083) (← links)
- Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
- The inverse-parametric knapsack problem (Q1388831) (← links)
- An algorithm for approximate multiparametric linear programming (Q1431701) (← links)
- A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program (Q1821694) (← links)
- Geometry of the Gass-Saaty parametric cost LP algorithm (Q1825128) (← links)
- An approximation algorithm for a general class of parametric optimization problems (Q2156299) (← links)
- A study of piecewise linear-quadratic programs (Q2194127) (← links)
- On quantified linear implications (Q2254606) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
- Fuzzy facility location-allocation problem under the Hurwicz criterion (Q2384629) (← links)
- Facility location-allocation problem in random fuzzy environment: using \((\alpha,\beta )\)-cost minimization model under the Hurewicz criterion (Q2426892) (← links)
- On linear multiplicative programming. (Q2468549) (← links)
- A fast parametric assignment algorithm with applications in max-algebra (Q3057132) (← links)
- New results on the average behavior of simplex algorithms (Q3337215) (← links)
- Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games (Q3688122) (← links)
- Complexity of some parametric integer and network programming problems (Q3712126) (← links)
- Parametric maximal flows in generalized networks – complexity and algorithms (Q3813580) (← links)
- Algorithms for flows with parametric capacities (Q3823390) (← links)
- Fast Algorithms for Rank-1 Bimatrix Games (Q4994178) (← links)
- Parametric problems on graphs of bounded tree-width (Q5056150) (← links)
- Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs (Q5076726) (← links)
- Graph Clustering in All Parameter Regimes (Q5089206) (← links)
- A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)
- Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint (Q6097849) (← links)