The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (Q2355744)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases |
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
