The following pages link to (Q4039868):
Displayed 50 items.
- EP theorems and linear complementarity problems (Q1392569) (← links)
- Efficient computation of multiple solutions in quasibrittle fracture analysis (Q1402568) (← links)
- A set-valued force law for spatial Coulomb--Contensou friction. (Q1416512) (← links)
- A test for copositive matrices (Q1579526) (← links)
- Symbiosis between linear algebra and optimization (Q1591197) (← links)
- A class of sufficiently small friction coefficients for the uniqueness of the solution of the quasistatic contact problem. (Q1596839) (← links)
- Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
- New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization (Q1602710) (← links)
- Multiparametric demand transportation problem (Q1604061) (← links)
- Hybrid extreme point tabu search (Q1609924) (← links)
- The modulus-based nonsmooth Newton's method for solving a class of nonlinear complementarity problems of \(P\)-matrices (Q1616101) (← links)
- A preconditioned general modulus-based matrix splitting iteration method for linear complementarity problems of \(H\)-matrices (Q1625761) (← links)
- Fast convergence of an inexact interior point method for horizontal complementarity problems (Q1625766) (← links)
- The modulus-based matrix splitting iteration methods for second-order cone linear complementarity problems (Q1625774) (← links)
- Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
- Modulus-based matrix splitting algorithms for the quasi-complementarity problems (Q1651423) (← links)
- Nonmonotone smoothing Broyden-like method for generalized nonlinear complementarity problems (Q1676990) (← links)
- An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function (Q1677001) (← links)
- Error bounds for linear complementarity problems of \(S\)-Nekrasov matrices and \(B\)-\(S\)-Nekrasov matrices (Q1696436) (← links)
- Improved convergence theorems of modulus-based matrix splitting iteration method for nonlinear complementarity problems of \(H\)-matrices (Q1697289) (← links)
- Completely mixed strategies for generalized bimatrix and switching controller stochastic game (Q1697409) (← links)
- The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems (Q1715729) (← links)
- The sign-based methods for solving a class of nonlinear complementarity problems (Q1730396) (← links)
- An infinity norm bound for the inverse of Dashnic-Zusmanovich type matrices with applications (Q1736209) (← links)
- A generalization of the Gauss-Seidel iteration method for solving absolute value equations (Q1737146) (← links)
- A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs (Q1752600) (← links)
- A new exact approach for the 0-1 collapsing knapsack problem (Q1753399) (← links)
- The job shop scheduling problem with convex costs (Q1754305) (← links)
- An algorithm for computing all solutions of an absolute value equation (Q1758024) (← links)
- A Jacobian smoothing method for box constrained variational inequality problems (Q1765876) (← links)
- Steady-state performance evaluation of continuous mono-T-semiflow Petri nets (Q1776410) (← links)
- Principal pivot transforms of some classes of matrices (Q1779264) (← links)
- A continuation algorithm for a class of linear complementarity problems using an extrapolation technique (Q1801456) (← links)
- Note on combinatorial optimization with max-linear objective functions (Q1803670) (← links)
- The linear complementarity problem as a separable bilinear program (Q1804582) (← links)
- The generalized linear complementarity problem revisited (Q1814790) (← links)
- On finite termination of an iterative method for linear complementarity problems (Q1814795) (← links)
- A class of smoothing functions for nonlinear and mixed complementarity problems (Q1815073) (← links)
- On the resolution of monotone complementarity problems (Q1815077) (← links)
- \(P_ c\)-matrices and the linear complementarity problem (Q1816943) (← links)
- Fast finite methods for a system of linear inequalities (Q1819897) (← links)
- A primal-dual subgradient method for time staged capacity expansion planning (Q1820669) (← links)
- Efficient parallel linear programming (Q1821686) (← links)
- On \({\mathbb{K}}^{\Delta}\) (Q1821691) (← links)
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment (Q1823142) (← links)
- On the \(\epsilon\)-perturbation method for avoiding degeneracy (Q1824546) (← links)
- On totally dual integral systems (Q1824553) (← links)
- A good submatrix is hard to find (Q1836717) (← links)
- Some NP-complete problems in linear programming (Q1837108) (← links)
- On the equivalence of linear complementarity problems (Q1866003) (← links)