Maximizing polynomials subject to assignment constraints (Q4554944)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6976499
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximizing polynomials subject to assignment constraints |
scientific article; zbMATH DE number 6976499 |
Statements
Maximizing Polynomials Subject to Assignment Constraints (English)
0 references
12 November 2018
0 references
approximation algorithms
0 references
quadratic assignment problem
0 references
0.9980696439743042
0 references
0.7846865653991699
0 references
0.7811104655265808
0 references
0.7590203285217285
0 references
