The many-commodity location problem (the branch-and-bound method)

Autor:	I. M. Davydova, I. V. Romanovskii
Rok vydání:	1984
Předmět:	Mathematical optimization General Computer Science Computer science 1-center problem Branch and bound method Commodity (Marxism)
Zdroj:	Cybernetics. 19:681-686
ISSN:	1573-8337 0011-4235
DOI:	10.1007/bf01068765
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::2b78b93098441de320240bdfaa4f544a https://doi.org/10.1007/bf01068765 Zobrazit plný text záznamu Full text from SpringerLink