Team Orienteering with Time-Varying Profit

DOI10.1287/ijoc.2020.1026zbMath1492.90023MaRDI QIDQ5084650

Ning Zhu, Shoufeng Ma, Yossiri Adulyasak, Louis-Martin Rousseau, Qinxiao Yu

Publication date: 28 June 2022

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2020.1026

zbMATH Keywords

team orienteering; hybrid heuristic; routing and scheduling; mixed integer nonconvex programming; Benders branch-and-cut

Mathematics Subject Classification ID

90C11: Mixed integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B06: Transportation, logistics and supply chain management

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Uses Software

• TOMP
• SCIP
• NOMAD
• Ipopt
• NLopt
• GitHub