Branch‐and‐cut algorithms for the ‐arborescence star problem

Autor:	Geraldo Robson Mateus, Armando Honorio Pereira, Sebastián Urrutia
Rok vydání:	2020
Předmět:	Combinatorics Arborescence Computer science Management of Technology and Innovation Strategy and Management Management Science and Operations Research Business and International Management Star (graph theory) Integer programming Wireless sensor network Branch and cut Computer Science Applications
Zdroj:	International Transactions in Operational Research. 29:2374-2400
ISSN:	1475-3995 0969-6016
DOI:	10.1111/itor.12857
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::55bd1110e51c751098baed396b427e48 https://doi.org/10.1111/itor.12857 Zobrazit plný text záznamu Plný text