Ants can orienteer a thief in their robbery
Year of publication: |
2020
|
---|---|
Authors: | Chagas, Jonatas B. C. ; Wagner, Markus |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 48.2020, 6, p. 708-714
|
Subject: | Orienteering Problem | Knapsack Problem | Multi-component problems | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming |
-
A weighted-sum method for solving the bi-objective traveling thief problem
Chagas, Jonatas B. C., (2022)
-
The clustered orienteering problem
Angelelli, E., (2014)
-
Knapsack problems with sigmoid utilities : approximation algorithms via hybrid optimization
Srivastava, Vaibhav, (2014)
- More ...
-
A weighted-sum method for solving the bi-objective traveling thief problem
Chagas, Jonatas B. C., (2022)
-
The double traveling salesman problem with partial last‐in‐first‐out loading constraints
Chagas, Jonatas B. C., (2020)
-
Chagas, Jonatas B. C., (2019)
- More ...