The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (Q2355744): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: PROXIMUS / rank | |||
Normal rank | |||
Revision as of 15:17, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases |
scientific article |
Statements
The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (English)
0 references
24 July 2015
0 references
quadratic programming
0 references
0-1 variables
0 references
polynomial algorithms
0 references
complexity
0 references
pseudo-Boolean programming
0 references
