Pages that link to "Item:Q5741477"
From MaRDI portal
The following pages link to Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems (Q5741477):
Displaying 6 items.
- Efficiently solving the traveling thief problem using hill climbing and simulated annealing (Q781909) (← links)
- The packing while traveling problem (Q1751654) (← links)
- Diversity based selection for many-objective evolutionary optimisation problems with constraints (Q2055559) (← links)
- Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach (Q2080825) (← links)
- Ants can orienteer a thief in their robbery (Q2661549) (← links)
- A weighted-sum method for solving the bi-objective traveling thief problem (Q2669668) (← links)