Bumblebee visitation problem

DOI10.1016/J.DAM.2022.01.007zbMath1496.90105OpenAlexW4210809294MaRDI QIDQ5918762

Sandip Das, Harmender Gahlawat

Publication date: 4 August 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2022.01.007

zbMATH Keywords

dynamic programmingNP-hardnessbumblebee visitation problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
• The prize collecting traveling salesman problem
• Algorithms and Computation
• Bumblebee visitation problem

This page was built for publication: Bumblebee visitation problem