Complexity of MLDP

September 07, 2018 · The Ethereal · 🏛 arXiv.org

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Nancy A. Arellano-Arriaga, Julián Molina, Satu Elisa Schaeffer, Ada M. Álvarez-Socarrás, Iris A. Martínez-Salazar arXiv ID 1809.02656 Category cs.CC: Computational Complexity Cross-listed cs.DS Citations 1 Venue arXiv.org Last Checked 2 months ago
Abstract
We carry out an explicit examination of the NP-hardness of a bi- objective optimization problem to minimize distance and latency of a single-vehicle route designed to serve a set of client requests. In addition to being a Hamiltonian cycle the route is to minimize the traveled distance of the vehicle as well as the total waiting time of the clients along the route.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Computational Complexity