Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience (Q1725611)
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: Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience |
scientific article; zbMATH DE number 7023706
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience |
scientific article; zbMATH DE number 7023706 |
Statements
Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience (English)
0 references
14 February 2019
0 references
discrete location
0 references
set packing
0 references
facets
0 references
separation algorithm
0 references
0.8486464023590088
0 references
0.8122643828392029
0 references
0.8081216812133789
0 references
0.7907419204711914
0 references
0.7870982885360718
0 references
