An exact method with variable fixing for solving the generalized assignment problem

DOI10.1007/S10589-011-9432-0MaRDI QIDQ694523zbMATHOpenAlexFDO

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

zbMATH Keywords

dynamic programmingbranch and boundLagrangian relaxationgeneralized assignment problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Discrete location and assignment (90B80)

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

Cites work

• scientific article; zbMATH DE number 5158528 (Why is no real title available?)
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• A Minimal Algorithm for the 0-1 Knapsack Problem
• A branch and bound algorithm for the generalized assignment problem
• A computational study of exact knapsack separation for the generalized assignment problem
• A path relinking approach with ejection chains for the generalized assignment problem
• A tabu search heuristic for the generalized assignment problem
• An ejection chain approach for the generalized assignment problem
• Effective algorithm and heuristic for the generalized assignment problem.
• Integer-programming software systems
• Solving semidefinite quadratic problems within nonsmooth optimization algorithms
• Solving the generalized assignment problem: an optimizing and heuristic approach

Cited in

(13)

• Exact solution methods for a generalized assignment problem with location/allocation considerations
• Improved Lagrangian bounds and heuristics for the generalized assignment problem
• Convergence of the surrogate Lagrangian relaxation method
• Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem
• Primal Heuristics for Branch and Price: The Assets of Diving Methods
• A computational study of exact knapsack separation for the generalized assignment problem
• A new extended formulation of the generalized assignment problem and some associated valid inequalities
• An implementation of exact knapsack separation
• Exact makespan minimization of unrelated parallel machines
• A generic exact solver for vehicle routing and related problems
• An integer programming column generation principle for heuristic search methods
• 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

Describes a project that uses

Uses Software

• Knapsack

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)