Pages that link to "Item:Q1417503"
From MaRDI portal
The following pages link to Effective algorithm and heuristic for the generalized assignment problem. (Q1417503):
Displaying 13 items.
- An optimization-based heuristic for the machine reassignment problem (Q338859) (← links)
- Multi-neighborhood local search optimization for machine reassignment problem (Q342289) (← links)
- The equilibrium generalized assignment problem and genetic algorithm (Q422905) (← links)
- An exact method with variable fixing for solving the generalized assignment problem (Q694523) (← links)
- An LP-based heuristic procedure for the generalized assignment problem with special ordered sets (Q868998) (← links)
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems (Q884028) (← links)
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
- A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem (Q992649) (← links)
- Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem (Q2336062) (← links)
- Two stage decision making approach for Sensor Mission Assignment Problem (Q2954347) (← links)
- Exact solution of emerging quadratic assignment problems (Q3002542) (← links)
- Very large-scale variable neighborhood search for the generalized assignment problem (Q3604030) (← links)
- A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)
