Login / Signup

A weighted-sum method for solving the bi-objective traveling thief problem.

Jonatas B. C. ChagasMarkus Wagner
Published in: Comput. Oper. Res. (2022)
Keyphrases
  • weighted sum
  • objective function
  • dynamic programming
  • cost function
  • social networks
  • search space
  • upper bound
  • computational efficiency
  • combinatorial optimization
  • efficient solutions
  • bi objective