Solving the generalized assignment problem: an optimizing and heuristic approach
From MaRDI portal
Publication:2884558
DOI10.1287/IJOC.15.3.249.16075zbMATH Open1238.90090OpenAlexW2108203093MaRDI QIDQ2884558FDOQ2884558
Authors: 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
Recommendations
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)
Cited In (76)
- Guided design search in the interval-bounded sailor assignment problem
- An application of a generalised assignment problem: assigning recruiters to geographical locations
- A note on the exact solution of the minimum squared load assignment problem
- A three-phase matheuristic algorithm for the multi-day task assignment problem
- Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity
- Title not available (Why is that?)
- The elastic generalized assignment problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving a class of two-stage stochastic nonlinear integer programs using value functions
- Title not available (Why is that?)
- Generalized Assignment with Nonlinear Capacity Interaction
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
- Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach
- Repulsive assignment problem
- Optimization-based very large-scale neighborhood search for generalized assignment problems with location/allocation considerations
- A path relinking approach with ejection chains for the generalized assignment problem
- Exact solutions to a class of stochastic generalized assignment problems
- An efficient approximation for the generalized assignment problem
- A branch-and-price approach for the stochastic generalized assignment problem
- R \& D planning and the generalized assignment problem
- The generalized assignment problem with flexible jobs
- A generic exact solver for vehicle routing and related problems
- A survey of algorithms for the generalized assignment problem
- The equilibrium generalized assignment problem and genetic algorithm
- A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
- 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
- Title not available (Why is that?)
- The generalized assignment problem
- A generalized assignment model for dynamic supply chain capacity planning
- Adaptive heuristic for the generalized assignment problem
- An Effective Lagrangian Heuristic For The Generalized Assignment Problem
- Title not available (Why is that?)
- Resource-Constrained Assignment Scheduling
- Heuristics for the multi-resource generalized assignment problem
- A Survey of the Generalized Assignment Problem and Its Applications
- A column generation heuristic for a dynamic generalized assignment problem
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- A two-stage approach to solving large capacitated task allocation problems
- A tabu search heuristic for the generalized assignment problem
- Exact solution methods for a generalized assignment problem with location/allocation considerations
- 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 PERCENTILE SEARCH HEURISTIC FOR GENERALIZED ASSIGNMENT PROBLEMS WITH A VERY LARGE NUMBER OF JOBS
- Title not available (Why is that?)
- A network flow algorithm for solving generalized assignment problem
- Relaxation heuristics for a generalized assignment problem
- An algorithm for the bottleneck generalized assignment problem
- Stochastic binary problems with simple penalties for capacity constraints violations
- An exact method with variable fixing for solving 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
- Submodular optimization problems and greedy strategies: a survey
- A computational study of exact knapsack separation for the generalized assignment problem
- Solving a real world assignment problem with a metaheuristic
- Exact solution of emerging quadratic assignment problems
- 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
- Approach to finding the optimal solution in the assignment problem
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- Bees algorithm for generalized assignment problem
- Assignment problems with changeover cost
- A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem
- An ejection chain approach for the generalized assignment problem
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- A robust heuristic for the generalized assignment problem
- Logic cuts for multilevel generalized assignment problems.
- Effective algorithm and heuristic for the generalized assignment problem.
- A class of greedy algorithms for the generalized assignment problem
- A hybrid heuristic for the generalized assignment problem
- A new extended formulation of the generalized assignment problem and some associated valid inequalities
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- Generating Experimental Data for the Generalized Assignment Problem
- Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem
- On solving the Lagrangian dual of integer programs via an incremental approach
This page was built for publication: Solving the generalized assignment problem: an optimizing and heuristic approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884558)
