A Branch & Cut algorithm for a four-index assignment problem (Q4661104)
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 & Cut algorithm for a four-index assignment problem |
scientific article; zbMATH DE number 2151590
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Branch & Cut algorithm for a four-index assignment problem |
scientific article; zbMATH DE number 2151590 |
Statements
A Branch & Cut algorithm for a four-index assignment problem (English)
0 references
4 April 2005
0 references
integer programming
0 references
linear programming
0 references
Branch \& Cut
0 references
orthogonal Latin squares
0 references
0.7648745179176331
0 references
0.7411131858825684
0 references
0.7288004159927368
0 references
0.7252025008201599
0 references
0.7197141647338867
0 references
