Pages that link to "Item:Q884028"
From MaRDI portal
The following pages link to Lagrangian relaxation guided problem space search heuristics for generalized assignment problems (Q884028):
Displaying 12 items.
- Decomposition based hybrid metaheuristics (Q319285) (← links)
- The equilibrium generalized assignment problem and genetic algorithm (Q422905) (← links)
- Lagrangian heuristic for a class of the generalized assignment problems (Q611434) (← links)
- A Lagrangian bound for many-to-many assignment problems (Q975754) (← links)
- Resource-constrained management of heterogeneous assets with stochastic deterioration (Q1042122) (← links)
- Improved Lagrangian bounds and heuristics for the generalized assignment problem (Q1745880) (← links)
- Solving the wire-harness design problem at a European car manufacturer (Q1991185) (← links)
- Studying properties of Lagrangian bounds for many-to-many assignment problems (Q2017507) (← links)
- Lagrangian relaxation of the generic materials and operations planning model (Q2303321) (← links)
- A branching algorithm to solve binary problem in uncertain environment: an application in machine allocation problem (Q2329577) (← links)
- A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)
- Problem space search metaheuristics with fix and optimize approach for the integrated fleet sizing and replenishment planning problem (Q6189811) (← links)
