HMS: a hybrid multi-start algorithm for solving binary linear programs (Q1791895)
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: HMS: a hybrid multi-start algorithm for solving binary linear programs |
scientific article; zbMATH DE number 6951738
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | HMS: a hybrid multi-start algorithm for solving binary linear programs |
scientific article; zbMATH DE number 6951738 |
Statements
HMS: a hybrid multi-start algorithm for solving binary linear programs (English)
0 references
11 October 2018
0 references
binary problems
0 references
heuristic
0 references
multi-start
0 references
variable neighborhood descent
0 references
local branching
0 references
constraint propagation
0 references
0.7023710012435913
0 references
0.6825886368751526
0 references
0.6784570217132568
0 references
0.6714531183242798
0 references
0.669730007648468
0 references
