A variable depth search algorithm with branching search for the generalized assignment problem (Q4946717)
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 variable depth search algorithm with branching search for the generalized assignment problem |
scientific article; zbMATH DE number 1422772
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A variable depth search algorithm with branching search for the generalized assignment problem |
scientific article; zbMATH DE number 1422772 |
Statements
A variable depth search algorithm with branching search for the generalized assignment problem (English)
0 references
29 October 2000
0 references
assignment problem
0 references
branch-and-bound
0 references
local search
0 references
variable depth search procedure
0 references
0.8284638524055481
0 references
0.8179804086685181
0 references
0.8062049746513367
0 references
0.7977176308631897
0 references
