A branch-and-bound algorithm for the singly constrained assignment problem (Q2432890)
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: A branch-and-bound algorithm for the singly constrained assignment problem |
scientific article; zbMATH DE number 5067647
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound algorithm for the singly constrained assignment problem |
scientific article; zbMATH DE number 5067647 |
Statements
A branch-and-bound algorithm for the singly constrained assignment problem (English)
0 references
25 October 2006
0 references
linear assignment
0 references
branch-and-bound
0 references
side constraint
0 references
0 references
0.8356212377548218
0 references
0.8349178433418274
0 references
0.833246111869812
0 references
0.8192168474197388
0 references
