Pages that link to "Item:Q1804582"
From MaRDI portal
The following pages link to The linear complementarity problem as a separable bilinear program (Q1804582):
Displayed 7 items.
- On the solution of NP-hard linear complementarity problems (Q699514) (← links)
- Absolute value equations (Q865400) (← links)
- Absolute value programming (Q885823) (← links)
- Knapsack feasibility as an absolute value equation solvable by successive linear programming (Q1024724) (← links)
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique (Q1275717) (← links)
- Arbitrary-norm separating plane (Q1306363) (← links)
- Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)