Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach

DOI10.1287/IJOC.15.3.249.16075zbMath1238.90090OpenAlexW2108203093MaRDI QIDQ2884558

Robert M. Nauss

Publication date: 30 May 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.15.3.249.16075

zbMATH Keywords

integer programmingassignment problems

Mathematics Subject Classification ID

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

Related Items (27)

On solving the Lagrangian dual of integer programs via an incremental approach ⋮ A very large-scale neighborhood search algorithm for the multi-resource generalized assignment 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 ⋮ A Survey of the Generalized Assignment Problem and Its Applications ⋮ A generic exact solver for vehicle routing and related problems ⋮ Submodular optimization problems and greedy strategies: a survey ⋮ The equilibrium generalized assignment problem and genetic algorithm ⋮ Stochastic binary problems with simple penalties for capacity constraints violations ⋮ Exact solution of emerging quadratic assignment problems ⋮ Generalized cover facet inequalities for the generalized assignment problem ⋮ A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints ⋮ Repulsive assignment problem ⋮ An exact method with variable fixing for solving the generalized assignment problem ⋮ A computational study of exact knapsack separation for the generalized assignment problem ⋮ A new extended formulation of the generalized assignment problem and some associated valid inequalities ⋮ Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique ⋮ Bees algorithm for generalized assignment problem ⋮ Assignment problems with changeover cost ⋮ Very large-scale variable neighborhood search for the generalized assignment problem ⋮ A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem ⋮ Competence-based assignment of tasks to workers in factories with demand-driven manufacturing ⋮ Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations ⋮ Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem ⋮ A path relinking approach with ejection chains for the generalized assignment problem ⋮ An ejection chain approach for the generalized assignment problem ⋮ Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem

This page was built for publication: Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach