A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem (Q1814816)
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-and-cut algorithm for a generalization of the uncapacitated facility location problem |
scientific article; zbMATH DE number 940808
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem |
scientific article; zbMATH DE number 940808 |
Statements
A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem (English)
0 references
31 October 1996
0 references
uncapacitated facility location
0 references
index selection problem
0 references
database design
0 references
set packing
0 references
0.94335854
0 references
0.9247317
0 references
0.92113435
0 references
0.9183353
0 references
0.9183123
0 references
0 references
0.91151255
0 references
