Pages that link to "Item:Q4946717"
From MaRDI portal
The following pages link to A variable depth search algorithm with branching search for the generalized assignment problem (Q4946717):
Displaying 21 items.
- An efficient local search with noising strategy for Google machine reassignment problem (Q338851) (← links)
- Fast machine reassignment (Q338866) (← links)
- Multi-neighborhood local search optimization for machine reassignment problem (Q342289) (← links)
- A variable depth search branching (Q453047) (← links)
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems (Q884028) (← links)
- A computational study of exact knapsack separation for the generalized assignment problem (Q967219) (← 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)
- Variable neighbourhood structures for cycle location problems (Q1926979) (← links)
- Convergence of the surrogate Lagrangian relaxation method (Q2260658) (← links)
- Bees algorithm for generalized assignment problem (Q2266951) (← links)
- Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem (Q2336062) (← links)
- A path relinking approach with ejection chains for the generalized assignment problem (Q2570155) (← links)
- An ejection chain approach for the generalized assignment problem (Q2573015) (← links)
- A variable depth neighborhood search algorithm for the min-max arc crossing problem (Q2669507) (← links)
- On the variable-depth-search heuristic for the linear-cost generalized assignment problem (Q2752253) (← links)
- Variable neighborhood search for Google machine reassignment problem (Q2840775) (← links)
- A personal perspective on problem solving by general purpose solvers (Q3566446) (← links)
- An experimental study of variable depth search algorithms for the quadratic assignment problem (Q4904331) (← links)
- A variable neighbourhood search algorithm for the constrained task allocation problem (Q5387420) (← links)
- A tabu search heuristic for the generalized assignment problem (Q5938390) (← links)