Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
From MaRDI portal
Publication:3829355
Recommendations
- Solving the generalized assignment problem: an optimizing and heuristic approach
- The generalized assignment problem
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A survey of algorithms for the generalized assignment problem
- A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem
Cited in
(46)- Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach
- An homage to Joseph-Louis Lagrange and Pierre Huard
- An application-oriented guide for designing Lagrangean dual ascent algorithms
- A survey of algorithms for the generalized assignment problem
- A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem
- Generalized cover facet inequalities for the generalized assignment problem
- The bottleneck generalized assignment problem
- An application of a generalised assignment problem: assigning recruiters to geographical locations
- New assignment problem for decision making
- The generalized assignment problem
- Auxiliary tool allocation in flexible manufacturing systems
- Lagrangean heuristics for location problems
- Multivariate composite distributions for coefficients in synthetic optimization problems
- Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study
- Efficient cuts in Lagrangean `relax-and-cut' schemes
- Matheuristics: survey and synthesis
- Heuristics for the multi-resource generalized assignment problem
- A Survey of the Generalized Assignment Problem and Its Applications
- scientific article; zbMATH DE number 2227390 (Why is no real title available?)
- An algorithm for the generalized quadratic assignment problem
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- Greedy approaches for a class of nonlinear generalized assignment problems
- Personnel placement in a fuzzy environment
- Lagrangean/surrogate relaxation for generalized assignment problems
- The elastic generalized assignment problem
- A tabu search heuristic for the generalized assignment problem
- A simple dual algorithm for the generalised assignment problem
- An efficient algorithm for a class of generalized assignment problem
- Lagrangean relaxation. (With comments and rejoinder).
- Relaxation heuristics for a generalized assignment problem
- An algorithm for the bottleneck generalized assignment problem
- A network flow algorithm for solving generalized assignment problem
- An exact method with variable fixing for solving the generalized assignment problem
- scientific article; zbMATH DE number 3864974 (Why is no real title available?)
- scientific article; zbMATH DE number 3904310 (Why is no real title available?)
- An ejection chain approach for the generalized assignment problem
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- Solving the generalized assignment problem: an optimizing and heuristic approach
- Tabu search for the multilevel 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 multiplier adjustment technique for the capacitated concentrator location problem
- A set partitioning heuristic for the generalized assignment problem
- A new extended formulation of the generalized assignment problem and some associated valid inequalities
- Generating Experimental Data for the Generalized Assignment Problem
This page was built for publication: Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3829355)
