π
π
The Cartographer
Randomized Algorithm for the Maximum-Profit Routing Problem
May 13, 2023 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Bogdan Armaselu
arXiv ID
2305.07838
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.CC
Citations
0
Venue
arXiv.org
Last Checked
5 months ago
Abstract
In this paper, we consider the Maximum-Profit Routing Problem (MPRP), introduced in \cite{Armaselu-PETRA}. In MPRP, the goal is to route the given fleet of vehicles to pickup goods from specified sites in such a way as to maximize the profit, i.e., total quantity collected minus travelling costs. Although deterministic approximation algorithms are known for the problem, currently there is no randomized algorithm. In this paper, we propose the first randomized algorithm for MPRP.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted