A set partitioning heuristic for the generalized assignment problem

DOI10.1016/0377-2217(94)90338-7zbMath0798.90107OpenAlexW2062822390MaRDI QIDQ1319576

Luk N. Van Wassenhove, Marc Salomon, Dirk G. Cattrysse

Publication date: 5 May 1994

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

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90338-7

zbMATH Keywords

column generationupper and lower boundsheuristicdual ascentset partitioninggeneralized assignment

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items

A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem, A genetic algorithm for the generalised assignment problem, Determining the \(K\)-best solutions of knapsack problems, Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches, Supply capacity acquisition and allocation with uncertain customer demands, Lagrangian relaxation guided problem space search heuristics for generalized assignment problems, An integer programming column generation principle for heuristic search methods, A Survey of the Generalized Assignment Problem and Its Applications, Logic cuts for multilevel generalized assignment problems., Effective algorithm and heuristic for the generalized assignment problem., A new extended formulation of the generalized assignment problem and some associated valid inequalities, A tabu search heuristic for the generalized assignment problem, Bees algorithm for generalized assignment problem, A family of inequalities for the generalized assignment polytope, Genetic clustering algorithms., Very large-scale variable neighborhood search for the generalized assignment problem, Competence-based assignment of tasks to workers in factories with demand-driven manufacturing, Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem, Solving the generalised assignment problem using polyhedral results, A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations, A tabu search approach to the constraint satisfaction problem as a general problem solver

Uses Software

• LINDO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new Lagrangian relaxation approach to the generalized assignment problem
• On the integer properties of scheduling set partitioning models
• An algorithm for the solution of the 0-1 knapsack problem
• A survey of algorithms for the generalized assignment problem
• A property of assignment type mixed integer linear programming problems
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
• Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
• The Computation of Shadow Prices in Linear Programming
• A branch and bound algorithm for the generalized assignment problem
• An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
• The Set-Partitioning Problem: Set Covering with Equality Constraints