Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem (Q4180165): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/moor.3.4.322 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1982072587 / rank | |||
Normal rank | |||
Latest revision as of 20:47, 19 March 2024
scientific article; zbMATH DE number 3616221
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem |
scientific article; zbMATH DE number 3616221 |
Statements
Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem (English)
0 references
1978
0 references
Cycling
0 references
Linear Complementarity Problem
0 references
Digraph Models
0 references
P-Matrices
0 references
