Pages that link to "Item:Q1088908"

The following pages link to A new Lagrangian relaxation approach to the generalized assignment problem (Q1088908):

Displaying 31 items.

• Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach (Q684336) (← links)
• Improved Lagrangean decomposition: An application to the generalized assignment problem (Q922948) (← links)
• An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
• A decentralized coordination mechanism for integrated production-transportation-inventory problem in the supply chain using Lagrangian relaxation (Q1001384) (← links)
• A new Lagrangian relaxation approach to the generalized assignment problem (Q1088908) (← links)
• A survey of algorithms for the generalized assignment problem (Q1199507) (← links)
• Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study (Q1296795) (← links)
• Application of the scenario aggregation approach to a two-stage, stochastic, common component, inventory problem with a budget constraint (Q1308878) (← links)
• A technique for speeding up the solution of the Lagrangean dual (Q1315429) (← links)
• A set partitioning heuristic for the generalized assignment problem (Q1319576) (← links)
• Optimizing single-terminal dispatch of large volume trips to trucks (Q1339147) (← links)
• A Lagrangean heuristic for the capacitated concave minimum cost network flow problem (Q1341992) (← links)
• The bottleneck generalized assignment problem (Q1388853) (← links)
• Tabu search for the multilevel generalized assignment problem (Q1388882) (← links)
• Effective algorithm and heuristic for the generalized assignment problem. (Q1417503) (← links)
• The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation (Q1630276) (← links)
• A stochastic production planning problem with nonlinear cost (Q1761117) (← links)
• Lagrangean heuristics for location problems (Q1804069) (← links)
• Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type (Q1809805) (← links)
• Lagrangean/surrogate relaxation for generalized assignment problems (Q1809834) (← links)
• Maximal covering code multiplexing access telecommunication networks (Q1876173) (← links)
• Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← 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)
• Designing a minimal spanning tree network subject to a budget constraint (Q3799839) (← links)
• Heuristics for the multi-resource generalized assignment problem (Q4544217) (← links)
• A tabu search heuristic for the generalized assignment problem (Q5938390) (← links)
• Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity (Q6048199) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)
• A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)
• A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution (Q6201541) (← links)