Low budget traveling: the orienteering problem with hotel selection and budget constraint

DOI10.1007/978-3-031-24907-5_48MaRDI QIDQ6606578zbMATH OpenFDO

Authors Paul Päprer, Benedikt Zipfel

Publication date 17 September 2024

zbMATH Keywords

routingorienteering problemmulti-tripcapacity restricted

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• A greedy randomized adaptive search procedure for the orienteering problem with hotel selection
• The orienteering problem: a survey
• An Optimal Algorithm for the Orienteering Tour Problem
• A memetic algorithm for the orienteering problem with hotel selection
• On the tour planning problem

Cites work

• A greedy randomized adaptive search procedure for the orienteering problem with hotel selection
• A memetic algorithm for the orienteering problem with hotel selection

This page was built for publication: Low budget traveling: the orienteering problem with hotel selection and budget constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606578)