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