An exact method with variable fixing for solving the generalized assignment problem
DOI10.1007/S10589-011-9432-0zbMATH Open1259.90062OpenAlexW2061568192MaRDI QIDQ694523FDOQ694523
Authors: Marius Posta, Jacques A. Ferland, Philippe Michelon 
Publication date: 12 December 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-011-9432-0
Recommendations
- Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- Effective algorithm and heuristic for the generalized assignment problem.
- Solving the generalized assignment problem: an optimizing and heuristic approach
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Discrete location and assignment (90B80)
Cites Work
- Integer-programming software systems
- A branch and bound algorithm for the generalized assignment problem
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A Minimal Algorithm for the 0-1 Knapsack Problem
- A tabu search heuristic for the generalized assignment problem
- An ejection chain approach for the generalized assignment problem
- Title not available (Why is that?)
- Effective algorithm and heuristic for the generalized assignment problem.
- A path relinking approach with ejection chains for the generalized assignment problem
- A computational study of exact knapsack separation for the generalized assignment problem
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- Solving the generalized assignment problem: an optimizing and heuristic approach
Cited In (13)
- Exact makespan minimization of unrelated parallel machines
- A generic exact solver for vehicle routing and related problems
- 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
- Exact solution methods for a generalized assignment problem with location/allocation considerations
- Improved Lagrangian bounds and heuristics for the generalized assignment problem
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- An implementation of exact knapsack separation
- A computational study of exact knapsack separation for the generalized assignment problem
- Convergence of the surrogate Lagrangian relaxation method
- A new extended formulation of the generalized assignment problem and some associated valid inequalities
- An integer programming column generation principle for heuristic search methods
- Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem
Uses Software
This page was built for publication: An exact method with variable fixing for solving the generalized assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q694523)
