Conditional Markov Chain search for the simple plant location problem improves upper bounds on twelve Körkel-Ghosh instances (Q2315579): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Q373206 / rank | |||
Property / author | |||
Property / author: Boris I. Goldengorin / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2768227135 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1711.06347 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 04:53, 19 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Conditional Markov Chain search for the simple plant location problem improves upper bounds on twelve Körkel-Ghosh instances |
scientific article |
Statements
Conditional Markov Chain search for the simple plant location problem improves upper bounds on twelve Körkel-Ghosh instances (English)
0 references
25 July 2019
0 references