A heuristic for BILP problems: the single source capacitated facility location problem (Q296777)
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 heuristic for BILP problems: the single source capacitated facility location problem |
scientific article; zbMATH DE number 6597513
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A heuristic for BILP problems: the single source capacitated facility location problem |
scientific article; zbMATH DE number 6597513 |
Statements
A heuristic for BILP problems: the single source capacitated facility location problem (English)
0 references
23 June 2016
0 references
single source capacitated facility location problems
0 references
binary integer linear programming
0 references
heuristic algorithms
0 references
kernel search framework
0 references
0 references
0 references
0.90356565
0 references
0 references
0.9021741
0 references
0.89826834
0 references
0.8968126
0 references
0.89320755
0 references
0.89319634
0 references
0.89053684
0 references
