Pages that link to "Item:Q2669668"
From MaRDI portal
The following pages link to A weighted-sum method for solving the bi-objective traveling thief problem (Q2669668):
Displaying 4 items.
- Efficiently solving the traveling thief problem using hill climbing and simulated annealing (Q781909) (← links)
- A novel list-constrained randomized VND approach in GPU for the traveling thief problem (Q1791955) (← links)
- Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach (Q2080825) (← links)
- Designing a portfolio-based closed-loop supply chain network for dairy products with a financial approach: accelerated benders decomposition algorithm (Q6164624) (← links)