.png){kind=icon}
.png){kind=icon}
Return
Formulations and an exact algorithm for the Traveling Thief Problem
.png){kind=icon}
OA
AI
T
R
M
DOI：10.1016/j.ejor.2026.08.002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• Novel mixed-integer linear programming formulations for the Traveling Thief Problem. • Theoretical and empirical comparison of the formulations. • An exact algorithm is shown to be effective for instances with similar item weights. • New optimal values for benchmark instances are reported.
Keywords:
Combinatorial optimization
Traveling thief problem
Mixed-integer linear programming
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers