A cutting plane algorithm for the site layout planning problem with travel barriers (Q1652264)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6901397
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A cutting plane algorithm for the site layout planning problem with travel barriers |
scientific article; zbMATH DE number 6901397 |
Statements
A cutting plane algorithm for the site layout planning problem with travel barriers (English)
0 references
11 July 2018
0 references
site layout planning
0 references
mixed integer programming
0 references
cutting plane algorithms
0 references
decomposition methods
0 references
global optimisation
0 references
\(d\)-visibility
0 references
0.6973150372505188
0 references
0.6810278296470642
0 references
0.6796504259109497
0 references
0.6756634712219238
0 references
