Exact methods for the selective assessment routing problem

DOI10.1007/S10100-024-00943-YMaRDI QIDQ6857302zbMATH OpenFDO

Authors Joan Salvà Soler, V. C. Hemmelmayr, Günther R. Raidl

Publication date 17 February 2026

Published in CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10100-024-00943-Y

zbMATH Keywords

humanitarian logisticsmixed integer programmingteam orienteering problemvehicle routing problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A heuristic for the multiple tour maximum collection problem
• A lexicographic maximin approach to the selective assessment routing problem
• A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings
• An exact algorithm for team orienteering problems
• Integer Programming Formulation of Traveling Salesman Problems
• The orienteering problem
• The team orienteering problem: formulations and branch-cut and price
• Vehicle Routing

This page was built for publication: Exact methods for the selective assessment routing problem

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