The following pages link to (Q4039868):
Displayed 50 items.
- A new path-following algorithm for nonlinear \(P_*\) complementarity problems (Q853548) (← links)
- On critical capacity of arcs in a directed network (Q856164) (← links)
- A modified damped Newton method for linear complementarity problems (Q857647) (← links)
- A simplex algorithm for piecewise-linear fractional programming problems (Q859908) (← links)
- On computer-assisted proofs for solutions of linear complementarity problems (Q861881) (← links)
- Breast cancer prediction using the isotonic separation technique (Q877069) (← links)
- Enumeration-based approach to solving parametric linear complementarity problems (Q901133) (← links)
- A generalized Newton method of high-order convergence for solving the large-scale linear complementarity problem (Q903210) (← links)
- Study of a piecewise linear dynamic system with negative and positive stiffness (Q907672) (← links)
- A new \(O(n^ 2)\) shortest chain algorithm (Q911302) (← links)
- Perturbation results for the linear complementarity problem (Q917452) (← links)
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm (Q925253) (← links)
- Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era (Q928099) (← links)
- On linear fractional programming problem and its computation using a neural network model (Q928680) (← links)
- Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem (Q942413) (← links)
- Cyclic games and linear programming (Q944703) (← links)
- Equivalence of equilibrium problems and least element problems (Q946323) (← links)
- On a ``stability'' in the linear complementarity problem (Q947646) (← links)
- Generalizations of the hidden Minkowski property (Q947672) (← links)
- A generalized proximal-point-based prediction-correction method for variational inequality problems (Q950089) (← links)
- A smoothing Levenberg-Marquardt method for the extended linear complementarity problem (Q965571) (← links)
- Multiobjective model predictive control (Q976222) (← links)
- Imitation games and computation (Q993779) (← links)
- Good hidden \(P\)-matrix sandwiches (Q996290) (← links)
- Existence theory and \(Q\)-matrix characterization for the generalized linear complementarity problem: Revisited (Q1001293) (← links)
- A strongly polynomial simplex method for the linear fractional assignment problem (Q1003483) (← links)
- Integer version of the multipath flow network synthesis problem (Q1003728) (← links)
- Conjugate gradient method for the linear complementarity problem withs-matrix (Q1007676) (← links)
- Determining maximal efficient faces in multiobjective linear programming problem (Q1018182) (← links)
- Modeling and algorithm on a class of mechanical systems with unilateral constraints (Q1020241) (← links)
- Multi-commodity supply network planning in the forest supply chain (Q1027559) (← links)
- Solving stochastic complementarity problems in energy market modeling using scenario reduction (Q1042022) (← links)
- Worst case analysis of resistive networks using linear programming approach (Q1052993) (← links)
- On the complexity of a pivot step of the revised simplex algorithm (Q1068713) (← links)
- Minimax linear programming problem (Q1075944) (← links)
- A polynomial algorithm for testing the nonnegativity of principal minors of Z-matrices (Q1081665) (← links)
- On the solution of linear programming problems with free (unrestricted) variables (Q1086153) (← links)
- The linear complementarity problem and a subclass of fully semimonotone matrices (Q1087473) (← links)
- Strongly polynomial algorithm for a class of combinatorial LCPs (Q1088911) (← links)
- A new simple homotopy algorithm for linear programming. I (Q1102185) (← links)
- Two characterization theorems in complementarity theory (Q1102208) (← links)
- Computing complex chemical equilibria by generalized linear programming (Q1117837) (← links)
- The k most vital arcs in the shortest path problem (Q1119183) (← links)
- Special cases of the quadratic assignment problem (Q1129914) (← links)
- Ratio combinatorial programs (Q1130080) (← links)
- An O(n) algorithm for discrete n-point convex approximation with applications to continuous case (Q1132491) (← links)
- A time minimising transportation problem with quantity dependent time (Q1150308) (← links)
- The set of limiting distributions for a Markov chain with fuzzy transition probabilities (Q1156428) (← links)
- On the bottleneck linear programming problem (Q1161448) (← links)
- A preview of a tolerance approach to sensitivity analysis in linear programming (Q1171506) (← links)