The following pages link to (Q4495204):
Displaying 10 items.
- Multi-neighborhood local search optimization for machine reassignment problem (Q342289) (← links)
- Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships (Q556008) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems (Q884028) (← links)
- A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem (Q992649) (← links)
- An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
- An effective local search for the maximum clique problem (Q1041822) (← links)
- Bees algorithm for generalized assignment problem (Q2266951) (← links)
- A path relinking approach with ejection chains for the generalized assignment problem (Q2570155) (← links)
- A tabu search heuristic for the generalized assignment problem (Q5938390) (← links)
