A new algorithm for solving a special matching problem with a general form value function under constraints (Q2287164)
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 7157104
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new algorithm for solving a special matching problem with a general form value function under constraints |
scientific article; zbMATH DE number 7157104 |
Statements
A new algorithm for solving a special matching problem with a general form value function under constraints (English)
0 references
23 January 2020
0 references
quadratic assignment problem
0 references
invalid matchings
0 references
shortest path in graph
0 references
Dijkstra's algorithm
0 references
0 references
0 references
0.746144711971283
0 references
0.742591142654419
0 references
0.740220308303833
0 references
0.7356202006340027
0 references
0.7327306270599365
0 references
