Pages that link to "Item:Q1878405"
From MaRDI portal
The following pages link to Adaptive memory search for Boolean optimization problems (Q1878405):
Displayed 10 items.
- Generating meta-heuristic optimization code using ADATE (Q604934) (← links)
- Adaptive memory programming for the vehicle routing problem with multiple trips (Q850308) (← links)
- Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search (Q926338) (← links)
- Lasso solution strategies for the vehicle routing problem with pickups and deliveries (Q1011218) (← links)
- An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines (Q1762138) (← links)
- A tabu search approach for the livestock collection problem (Q2482370) (← links)
- Adaptive memory search for multidemand multidimensional knapsack problems (Q2489302) (← links)
- Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization (Q3509451) (← links)
- Simple heuristics for the multi-period fleet size and mix vehicle routing problem (Q5879646) (← links)
- Exponential extrapolation memory for tabu search (Q6114931) (← links)