Pages that link to "Item:Q992649"
From MaRDI portal
The following pages link to A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem (Q992649):
Displaying 18 items.
- Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2) (Q322556) (← links)
- An effective matheuristic for the capacitated total quantity discount problem (Q336744) (← links)
- Multi-neighborhood local search optimization for machine reassignment problem (Q342289) (← links)
- Two heuristic solution concepts for the vehicle selection problem in line haul transports (Q439400) (← links)
- A note of reduced dimension optimization algorithm of assignment problem (Q887868) (← links)
- Branch and bound crossed with GA to solve hybrid flowshops (Q1296101) (← links)
- Tabu search for the multilevel generalized assignment problem (Q1388882) (← links)
- A hybrid heuristic for the generalized assignment problem (Q1390290) (← links)
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches (Q1908034) (← links)
- Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem (Q2336062) (← links)
- Fleet management: a vehicle and driver assignment model (Q2424765) (← links)
- Optimal ABC inventory classification using interval programming (Q2792928) (← links)
- An ejection chain approach for the generalized assignment problem (Q2890415) (← links)
- A hybrid algorithm for the generalized assignment problem (Q3348709) (← links)
- (Q3626421) (← links)
- A dynamic tabu search for large-scale generalized assignment problems (Q5945334) (← links)
- A three-phase matheuristic algorithm for the multi-day task assignment problem (Q6047850) (← links)
- Hybrid Ant Colony Optimization Algorithms—Behaviour Investigation Based on Intuitionistic Fuzzy Logic (Q6110177) (← links)
