Ants can orienteer a thief in their robbery

DOI10.1016/j.orl.2020.08.011OpenAlexW3081561826MaRDI QIDQ2661549

Jonatas B. C. Chagas, Markus Wagner

Publication date: 7 April 2021

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.07017

zbMATH Keywords

knapsack problemant colony optimizationorienteering problemmulti-component problems

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (2)

A polynomial-time approximation scheme for thief orienteering on directed acyclic graphs ⋮ Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach

Uses Software

• SPOT
• irace

Cites Work

• Unnamed Item
• Unnamed Item
• Orienteering problem: a survey of recent variants, solution approaches and applications
• Time-dependent routing problems: a review
• The orienteering problem: a survey
• A fast and effective heuristic for the orienteering problem
• Attractive orienteering problem with proximity and timing interactions
• Ant colony optimization theory: a survey
• The orienteering problem
• A Periodic Traveling Politician Problem with Time-Dependent Rewards
• Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems

This page was built for publication: Ants can orienteer a thief in their robbery