Pages that link to "Item:Q922948"

The following pages link to Improved Lagrangean decomposition: An application to the generalized assignment problem (Q922948):

Displaying 14 items.

• Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
• A constrained Steiner tree problem (Q1129916) (← links)
• A survey of algorithms for the generalized assignment problem (Q1199507) (← links)
• A multi-product loading problem: A model and solution method (Q1278990) (← links)
• The return plant location problem: Modelling and resolution (Q1291663) (← links)
• Optimizing single-terminal dispatch of large volume trips to trucks (Q1339147) (← links)
• A bound-improving approach to discrete programming problems (Q1340059) (← links)
• Tabu search for the multilevel generalized assignment problem (Q1388882) (← links)
• An improved Lagrangian relaxation algorithm for the robust generation self-scheduling problem (Q1721218) (← links)
• A stochastic production planning problem with nonlinear cost (Q1761117) (← links)
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches (Q1908034) (← links)
• Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan (Q1969830) (← links)
• A tabu search heuristic for the generalized assignment problem (Q5938390) (← links)
• A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)