Improved Lagrangean decomposition: An application to the generalized assignment problem

DOI10.1016/0377-2217(90)90300-ZzbMath0711.90055OpenAlexW2085709429MaRDI QIDQ922948

Paulo Barcia, Kurt O. Jørnsten

Publication date: 1990

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(90)90300-z

zbMATH Keywords

assignment problemsvariable splittingLagrangean duallower bound improving techniquespecially structured pure integer programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (14)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The bound improving sequence algorithm
• Exact methods for the knapsack problem and its generalizations
• A new Lagrangian relaxation approach to the generalized assignment problem
• Constructive dual methods for discrete programming
• A revised bound improvement sequence algorithm
• An algorithm for the solution of the 0-1 knapsack problem
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Lower bounds to the graph partitioning problem through generalized linear programming and network flows
• Validation of subgradient optimization

This page was built for publication: Improved Lagrangean decomposition: An application to the generalized assignment problem