Effective algorithm and heuristic for the generalized assignment problem.

DOI10.1016/S0377-2217(02)00710-5zbMath1137.90719OpenAlexW2002617580MaRDI QIDQ1417503

Hacene Ouzia, Salim Haddadi

Publication date: 5 January 2004

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00710-5

zbMATH Keywords

heuristicKnapsackBranch-and-BoundGeneralized assignmentSolution improvement

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (13)

An optimization-based heuristic for the machine reassignment problem ⋮ Multi-neighborhood local search optimization for machine reassignment problem ⋮ An LP-based heuristic procedure for the generalized assignment problem with special ordered sets ⋮ Lagrangian relaxation guided problem space search heuristics for generalized assignment problems ⋮ Two stage decision making approach for Sensor Mission Assignment Problem ⋮ A Survey of the Generalized Assignment Problem and Its Applications ⋮ The equilibrium generalized assignment problem and genetic algorithm ⋮ Exact solution of emerging quadratic assignment problems ⋮ An exact method with variable fixing for solving the generalized assignment problem ⋮ Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique ⋮ Very large-scale variable neighborhood search for the generalized assignment problem ⋮ A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem ⋮ Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new Lagrangian relaxation approach to the generalized assignment problem
• A survey of algorithms for the generalized assignment problem
• A set partitioning heuristic for the generalized assignment problem
• A genetic algorithm for the generalised assignment problem
• An Ejection Chain Approach for the Generalized Assignment Problem
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• A new heuristic for determining fleet size and composition
• Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
• Generalized Assignment with Nonlinear Capacity Interaction
• Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
• A branch and bound algorithm for the generalized assignment problem
• An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
• Modeling Facility Location Problems as Generalized Assignment Problems
• A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• Validation of subgradient optimization
• Lagrangian Decomposition Based Heuristic For The Generalized Assignment Problem
• An Effective Lagrangian Heuristic For The Generalized Assignment Problem

This page was built for publication: Effective algorithm and heuristic for the generalized assignment problem.