The bilinear assignment problem: complexity and polynomially solvable special cases (Q1683688): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q175380 |
||
| Property / author | |||
| Property / author: Binay K. Bhattacharya / rank | |||
Revision as of 04:02, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The bilinear assignment problem: complexity and polynomially solvable special cases |
scientific article |
Statements
The bilinear assignment problem: complexity and polynomially solvable special cases (English)
0 references
1 December 2017
0 references
bilinear assignment problem
0 references
quadratic assignment
0 references
bilinear programs
0 references
domination analysis
0 references
heuristics
0 references
polynomially solvable cases
0 references
linearization
0 references
