Pages that link to "Item:Q761967"
From MaRDI portal
The following pages link to A new polynomial-time algorithm for linear programming (Q761967):
Displaying 50 items.
- Spatial reasoning in a fuzzy region connection calculus (Q835806) (← links)
- Strip packing with precedence constraints and strip packing with release times (Q837172) (← links)
- The weighted link ring loading problem (Q839671) (← links)
- Interior point method for long-term generation scheduling of large-scale hydrothermal systems (Q839779) (← links)
- An explicit finite difference approach to the pricing problems of perpetual Bermudan options (Q842831) (← links)
- KBO orientability (Q846165) (← links)
- Computing a quasi-perfect equilibrium of a two-player game (Q847801) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Fuzzy goal programming: complementary slackness conditions and computational schemes (Q849750) (← links)
- A combined homotopy interior point method for the linear complementarity problem (Q849782) (← links)
- Classification methods for random utility models with i.i.d. disturbances under the most probable alternative rule (Q853063) (← links)
- Feasible region contraction interior point algorithm (Q858800) (← links)
- On the complexity of a combined homotopy interior method for convex programming (Q859861) (← links)
- A matrix generation approach for eigenvalue optimization (Q868452) (← links)
- Bargaining over multiple issues in finite horizon alternating-offers protocol (Q870811) (← links)
- On the complexity of deriving position specific score matrices from positive and negative sequences (Q876465) (← links)
- Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks (Q876471) (← links)
- Computing upper and lower bounds in interval decision trees (Q877064) (← links)
- An adaptation of the dual-affine interior point method for the surface flatness problem (Q877663) (← links)
- Artificial time integration (Q878202) (← links)
- An extended variant of Karmarkar's interior point algorithm (Q879548) (← links)
- A hybrid clustering algorithm (Q883287) (← links)
- Exchange market equilibria with Leontief's utility: freedom of pricing leads to rationality (Q883994) (← links)
- An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization (Q894428) (← links)
- A new probabilistic constraint logic programming language based on a generalised distribution semantics (Q896427) (← links)
- On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems (Q897915) (← links)
- Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions (Q903629) (← links)
- An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness (Q904955) (← links)
- Experiments with external pivoting (Q909578) (← links)
- Preemptive scheduling of independent jobs with release times and deadlines on a hypercube (Q910210) (← links)
- Karmarkar's algorithm with improved steps (Q910334) (← links)
- Cubically convergent method for locating a nearby vertex in linear programming (Q911456) (← links)
- Asymptotic behaviour of Karmarkar's method for linear programming (Q911987) (← links)
- A ``build-down'' scheme for linear programming (Q912758) (← links)
- Decomposed block Cholesky factorization in the Karmarkar algorithm. Solving a class of super large LP problems (Q914546) (← links)
- On learning a union of half spaces (Q915490) (← links)
- Multiterminal global routing: A deterministic approximation scheme (Q916369) (← links)
- A geometric property of the least squares solution of linear equations (Q916747) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- An algorithm for linear programming that is easy to implement (Q917443) (← links)
- The solution of large-scale least-squares problems on supercomputers (Q918420) (← links)
- On the improvement per iteration in Karmarkar's algorithm for linear programming (Q918862) (← links)
- A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm (Q920840) (← links)
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations (Q920841) (← links)
- Solving linear programs from sign patterns (Q927161) (← links)
- Approximation schemes for packing with item fragmentation (Q927410) (← links)
- Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era (Q928099) (← links)
- Simple search methods for finding a Nash equilibrium (Q932813) (← links)
- Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization (Q940836) (← links)
- A simpler and tighter redundant Klee-Minty construction (Q941030) (← links)
