Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (Q1695015)
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: Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs |
scientific article |
Statements
Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (English)
0 references
6 February 2018
0 references
combinatorial optimization
0 references
heuristics
0 references
set covering problem
0 references
set partitioning problem
0 references
local search
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7446638941764832
0 references
0.7086535692214966
0 references
0.7081478238105774
0 references
0.708138108253479
0 references
0.7081378102302551
0 references
