The generalized assignment problem
From MaRDI portal
Publication:3372332
zbMATH Open1137.90588MaRDI QIDQ3372332FDOQ3372332
Authors: Robert M. Nauss
Publication date: 20 February 2006
Recommendations
- Solving the generalized assignment problem: an optimizing and heuristic approach
- The elastic generalized assignment problem
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- A survey of algorithms for the generalized assignment problem
- Generalized Assignment with Nonlinear Capacity Interaction
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cited In (43)
- Title not available (Why is that?)
- Addressing capacity uncertainty in resource-constrained assignment problems
- The generalized assignment problem with minimum quantities
- Generalized Assignment with Nonlinear Capacity Interaction
- The generalized assignment problem: Valid inequalities and facets
- Coupled and k-Sided Placements: Generalizing Generalized Assignment
- R \& D planning and the generalized assignment problem
- The generalized assignment problem with flexible jobs
- A survey of algorithms for 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
- Bicriteria multiresource generalized assignment problem
- An application of a generalised assignment problem: assigning recruiters to geographical locations
- New assignment problem for decision making
- A note on the exact solution of the minimum squared load assignment problem
- A generalized assignment model for dynamic supply chain capacity planning
- Title not available (Why is that?)
- A multi-period renewal equipment problem
- Assignment problems with complementarities
- A Survey of the Generalized Assignment Problem and Its Applications
- Title not available (Why is that?)
- The assignment problem
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- The elastic generalized assignment problem
- Exact solution methods for a generalized assignment problem with location/allocation considerations
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems
- An optimization-based heuristic for the machine reassignment problem
- Multi-neighborhood local search optimization for machine reassignment problem
- Exact solutions to task allocation problems
- A network flow algorithm for solving generalized assignment problem
- An algorithm for the bottleneck generalized assignment problem
- Title not available (Why is that?)
- A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem
- On the generalized dining philosophers problem
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- Solving the generalized assignment problem: an optimizing and heuristic approach
- Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships
- A class of greedy algorithms for the generalized assignment problem
- A Generalized Problem of Optimal Selection and Assignment
- The \(\beta\)-assignment problem in general graphs
- Reducing the elastic generalized assignment problem to the standard generalized assignment problem
- Generating Experimental Data for the Generalized Assignment Problem
This page was built for publication: The generalized assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3372332)