Pages that link to "Item:Q1104872"
From MaRDI portal
The following pages link to An experimental investigation of enumerative methods for the linear complementarity problem (Q1104872):
Displayed 15 items.
- On the solution of NP-hard linear complementarity problems (Q699514) (← links)
- An enumerative method for the solution of linear complementarity problems (Q1110460) (← links)
- Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes \(Q\) and \(Q_ 0\) (Q1177232) (← links)
- A computational analysis of LCP methods for bilinear and concave quadratic programming (Q1184453) (← links)
- A sequential LCP method for bilevel linear programming (Q1184523) (← links)
- An algorithm for the mixed-integer nonlinear bilevel programming problem (Q1184528) (← links)
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique (Q1275717) (← links)
- Bilevel and multilevel programming: A bibliography review (Q1338535) (← links)
- The steepest descent direction for the nonlinear bilevel programming problem (Q1342274) (← links)
- A multilevel analysis of agricultural credit distribution in East Java, Indonesia (Q1342340) (← links)
- Algorithms for linear programming with linear complementarity constraints (Q1935876) (← links)
- An RLT approach for solving the binary-constrained mixed linear complementarity problem (Q2002841) (← links)
- Bilevel linear programming (Q2368110) (← links)
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience (Q2488050) (← links)
- A note on the Pareto optimality of solutions to the linear bilevel programming problem (Q2638930) (← links)