The Profitable Close-Enough Arc Routing Problem

Autor:	Nicola Bianchessi, Ángel Corberán, Isaac Plana, Miguel Reula, José M. Sanchis
Rok vydání:	2022
Předmět:	General Computer Science Modeling and Simulation Management Science and Operations Research
Zdroj:	Computers & Operations Research. 140:105653
ISSN:	0305-0548
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::174b11d50ff1fee05be148e1c277ced5 https://doi.org/10.1016/j.cor.2021.105653 Zobrazit plný text záznamu Full Text from ScienceDirect