On finding a cyclic tour and a vehicle loading plan yielding maximum profit

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)

zbMATH Keywords

polynomial algorithmtraveling salesman's problemcharging transport meansprofit from buying and sellingsimple sequence

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Cites Work

• Two Algorithmic Results for the Traveling Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On finding a cyclic tour and a vehicle loading plan yielding maximum profit