On finding a cyclic tour and a vehicle loading plan yielding maximum profit
From MaRDI portal
Publication:4242569
DOI10.1016/S0166-218X(02)00298-6zbMath0921.90066MaRDI QIDQ4242569
A. I. Serdyukov, E. Kh. Gimadi, N. I. Glebov
Publication date: 11 May 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
polynomial algorithm; traveling salesman's problem; charging transport means; profit from buying and selling; simple sequence
90B06: Transportation, logistics and supply chain management
Cites Work