Efficient sensor placement and online scheduling of bin collection

DOI10.1016/j.cor.2022.106113OpenAlexW4310731468MaRDI QIDQ6109313

Manuel P. Lopes, Tânia R. P. Ramos

Publication date: 4 July 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2022.106113

zbMATH Keywords

predictionroutingonline schedulingsensor placementwaste collection

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

Improved approximation algorithms for \(k\)-submodular maximization under a knapsack constraint

Cites Work

• Unnamed Item
• What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives
• The complexity of facets (and some facets of complexity)
• Waste collection inventory routing with non-stationary stochastic demands
• A hybrid metaheuristic for smart waste collection problems with workload concerns
• Dynamic Vehicle Routing for Translating Demands: Stability Analysis and Receding-Horizon Policies

This page was built for publication: Efficient sensor placement and online scheduling of bin collection