A survey of algorithms for the generalized assignment problem

DOI10.1016/0377-2217(92)90077-MzbMATH Open0760.90071OpenAlexW1978264569MaRDI QIDQ1199507FDOQ1199507

Authors: Dirk Cattrysse, Luk N. Van Wassenhove 

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90077-m

Recommendations

• The generalized assignment problem
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• Solving the generalized assignment problem: an optimizing and heuristic approach
• Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
• scientific article; zbMATH DE number 3989103

zbMATH Keywords

heuristicsbranch-and-boundminimum cost assignment of jobs to agents

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10) Boolean programming (90C09)

Cites Work

• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Facets of the knapsack polytope
• Title not available (Why is that?)
• Generalized Assignment with Nonlinear Capacity Interaction
• A branch and bound algorithm for the generalized assignment problem
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• A Dual-Based Procedure for Uncapacitated Facility Location
• Exact methods for the knapsack problem and its generalizations
• An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
• Modeling Facility Location Problems as Generalized Assignment Problems
• Title not available (Why is that?)
• An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• Pivot and Complement–A Heuristic for 0-1 Programming
• Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
• A new Lagrangian relaxation approach to the generalized assignment problem
• Nonlinear 0–1 programming: I. Linearization techniques
• Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
• Nonlinear 0–1 programming: II. Dominance relations and algorithms
• An application-oriented guide for designing Lagrangean dual ascent algorithms
• Zero-one integer programs with few contraints - lower bounding theory
• Zero-one integer programs with few constraints - Efficient branch and bound algorithms
• The bound improving sequence algorithm
• A revised bound improvement sequence algorithm
• Improved Lagrangean decomposition: An application to the generalized assignment problem
• A property of assignment type mixed integer linear programming problems
• A hybrid algorithm for the generalized assignment problem

Cited In (79)

• Improved Online Algorithms for Knapsack and GAP in the Random Order Model
• A branching algorithm to solve binary problem in uncertain environment: an application in machine allocation problem
• Variable neighbourhood search based on Metropolis criterion for crowdsourced delivery scheduling problem in dispatch model
• Maximal covering code multiplexing access telecommunication networks
• Title not available (Why is that?)
• A three-phase matheuristic algorithm for the multi-day task assignment problem
• On a class of assignment problems.
• Tight Approximation Bounds for the Seminar Assignment Problem
• Improved online algorithms for Knapsack and GAP in the random order model
• Two stage decision making approach for sensor mission assignment problem
• Loading tow trains ergonomically for just-in-time part supply
• Exact solution methods for a generalized assignment problem with location/allocation considerations
• Fair task allocation problem
• Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences
• A multiplier adjustment technique for the capacitated concentrator location problem
• Sensitivity analysis of combinatorial optimization problems using evolutionary bilevel optimization and data mining
• The generalized assignment problem with minimum quantities
• New mathematical models for team formation of sports clubs before the match
• Optimizing cane supply decisions within a sugar mill region
• Repulsive assignment problem
• A note on exact algorithms for the bottleneck generalized assignment problem
• Optimization-based very large-scale neighborhood search for generalized assignment problems with location/allocation considerations
• Exact solutions to a class of stochastic generalized assignment problems
• A comprehensive survey of the reviewer assignment problem
• An exact algorithm for the minimum squared load assignment problem
• The capacitated mobile facility location problem
• Assignment problems: a golden anniversary survey
• R \& D planning and the generalized assignment problem
• The equilibrium generalized assignment problem and genetic algorithm
• A hybrid algorithm for the generalized assignment problem
• An approximation algorithm for the generalized assignment problem
• Low earth orbit satellite based communication systems -- research opportunities
• Elitist genetic algorithm for assignment problem with imprecise goal
• Supply capacity acquisition and allocation with uncertain customer demands
• Overcoming human trafficking via operations research and analytics: opportunities for methods, models, and applications
• Reducing multivalued discrete variables in solving separable task assignment problems
• Title not available (Why is that?)
• The generalized assignment problem
• Exploiting process plan flexibility in production scheduling: A multi-objective approach
• Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study
• Heuristics for the multi-resource generalized assignment problem
• A Survey of the Generalized Assignment Problem and Its Applications
• Solving the generalised assignment problem using polyhedral results
• Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
• A tabu search approach to the constraint satisfaction problem as a general problem solver
• Lagrangean/surrogate relaxation for generalized assignment problems
• A tabu search heuristic for the generalized assignment problem
• The stochastic generalised assignment problem with Bernoulli demands
• A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
• Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
• Fast machine reassignment
• Multi-neighborhood local search optimization for machine reassignment problem
• A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm
• A PERCENTILE SEARCH HEURISTIC FOR GENERALIZED ASSIGNMENT PROBLEMS WITH A VERY LARGE NUMBER OF JOBS
• Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming
• Relaxation heuristics for a generalized assignment problem
• A genetic algorithm for the project assignment problem
• Stochastic binary problems with simple penalties for capacity constraints violations
• Constructing a course schedule by solving a series of assignment type problems
• Online generalized assignment problem with historical information
• Product allocation to different types of distribution center in retail logistics networks
• Development and evaluation of an assignment heuristic for allocating cross-trained workers
• Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
• Very large-scale variable neighborhood search for the generalized assignment problem
• Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
• A dynamic tabu search for large-scale generalized assignment problems
• Optimal ABC inventory classification using interval programming
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• Distribution requirements and compactness constraints in school timetabling
• A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
• Effective algorithm and heuristic for the generalized assignment problem.
• Utilizing individual picker skills to improve order batching in a warehouse
• A class of greedy algorithms for the generalized assignment problem
• A set partitioning heuristic for the generalized assignment problem
• A genetic algorithm for the generalised assignment problem
• A hybrid heuristic for the generalized assignment problem
• A new extended formulation of the generalized assignment problem and some associated valid inequalities
• Competitive strategies for an online generalized assignment problem with a service consecution constraint
• On solving the Lagrangian dual of integer programs via an incremental approach

This page was built for publication: A survey of algorithms for the generalized assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199507)