A survey of algorithms for the generalized assignment problem
From MaRDI portal
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)
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
Cites work
- scientific article; zbMATH DE number 3743004 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- A branch and bound algorithm for the generalized assignment problem
- A hybrid algorithm for the generalized assignment problem
- A new Lagrangian relaxation approach to the generalized assignment problem
- A property of assignment type mixed integer linear programming problems
- A revised bound improvement sequence algorithm
- An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
- An application-oriented guide for designing Lagrangean dual ascent algorithms
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Exact methods for the knapsack problem and its generalizations
- Facets of the knapsack polytope
- Generalized Assignment with Nonlinear Capacity Interaction
- Improved Lagrangean decomposition: An application to the generalized assignment problem
- Modeling Facility Location Problems as Generalized Assignment Problems
- Nonlinear 0–1 programming: I. Linearization techniques
- Nonlinear 0–1 programming: II. Dominance relations and algorithms
- Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
- Pivot and Complement–A Heuristic for 0-1 Programming
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The bound improving sequence algorithm
- Zero-one integer programs with few constraints - Efficient branch and bound algorithms
- Zero-one integer programs with few contraints - lower bounding theory
Cited in
(80)- A genetic algorithm for the generalised assignment problem
- Competitive strategies for an online generalized assignment problem with a service consecution constraint
- A tabu search heuristic for the generalized assignment problem
- A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
- Effective algorithm and heuristic for the generalized assignment problem.
- Heuristics for the multi-resource generalized assignment problem
- scientific article; zbMATH DE number 3989103 (Why is no real title available?)
- Utilizing individual picker skills to improve order batching in a warehouse
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- The generalized assignment problem
- The equilibrium generalized assignment problem and genetic algorithm
- Elitist genetic algorithm for assignment problem with imprecise goal
- The stochastic generalised assignment problem with Bernoulli demands
- Stochastic binary problems with simple penalties for capacity constraints violations
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- A hybrid heuristic for the generalized assignment problem
- Distribution requirements and compactness constraints in school timetabling
- A note on exact algorithms for the bottleneck generalized assignment problem
- A dynamic tabu search for large-scale generalized assignment problems
- Constructing a course schedule by solving a series of assignment type problems
- A network flow algorithm for solving generalized assignment problem
- A Survey of the Generalized Assignment Problem and Its Applications
- New mathematical models for team formation of sports clubs before the match
- Lagrangean/surrogate relaxation for generalized assignment problems
- Solving the generalised assignment problem using polyhedral results
- Optimizing cane supply decisions within a sugar mill region
- Online generalized assignment problem with historical information
- A new extended formulation of the generalized assignment problem and some associated valid inequalities
- Product allocation to different types of distribution center in retail logistics networks
- The generalized assignment problem with minimum quantities
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
- Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study
- Supply capacity acquisition and allocation with uncertain customer demands
- A hybrid algorithm for the generalized assignment problem
- A comprehensive survey of the reviewer assignment problem
- A \((1-1/e)\)-approximation algorithm for the generalized assignment problem
- Optimization-based very large-scale neighborhood search for generalized assignment problems with location/allocation considerations
- Exploiting process plan flexibility in production scheduling: A multi-objective approach
- R \& D planning and the generalized assignment problem
- A class of greedy algorithms for the generalized assignment problem
- A set partitioning heuristic for the generalized assignment problem
- On solving the Lagrangian dual of integer programs via an incremental approach
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
- A tabu search approach to the constraint satisfaction problem as a general problem solver
- An exact algorithm for the minimum squared load assignment problem
- An approximation algorithm for the generalized assignment problem
- The capacitated mobile facility location problem
- Exact solutions to a class of stochastic generalized assignment problems
- Assignment problems: a golden anniversary survey
- Optimal ABC inventory classification using interval programming
- Fast machine reassignment
- Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming
- Very large-scale variable neighborhood search for the generalized assignment problem
- Repulsive assignment problem
- Reducing multivalued discrete variables in solving separable task assignment problems
- Multi-neighborhood local search optimization for machine reassignment problem
- Relaxation heuristics for a generalized assignment problem
- Low earth orbit satellite based communication systems -- research opportunities
- A genetic algorithm for the project assignment problem
- A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm
- Development and evaluation of an assignment heuristic for allocating cross-trained workers
- A PERCENTILE SEARCH HEURISTIC FOR GENERALIZED ASSIGNMENT PROBLEMS WITH A VERY LARGE NUMBER OF JOBS
- Exact solution methods for a generalized assignment problem with location/allocation considerations
- A branching algorithm to solve binary problem in uncertain environment: an application in machine allocation problem
- Maximal covering code multiplexing access telecommunication networks
- Sensitivity analysis of combinatorial optimization problems using evolutionary bilevel optimization and data mining
- On a class of assignment problems.
- Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences
- Two stage decision making approach for sensor mission assignment problem
- A multiplier adjustment technique for the capacitated concentrator location problem
- Improved online algorithms for knapsack and GAP in the random order model
- Tight Approximation Bounds for the Seminar Assignment Problem
- scientific article; zbMATH DE number 7780121 (Why is no real title available?)
- Loading tow trains ergonomically for just-in-time part supply
- Fair task allocation problem
- Variable neighbourhood search based on Metropolis criterion for crowdsourced delivery scheduling problem in dispatch model
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model
- Overcoming human trafficking via operations research and analytics: opportunities for methods, models, and applications
- A three-phase matheuristic algorithm for the multi-day task assignment problem
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)
