An exact method with variable fixing for solving the generalized assignment problem - Archive ouverte HAL Access content directly
Journal Articles Computational Optimization and Applications Year : 2012

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

Abstract

We propose a simple exact algorithm for solving the generalized assignment problem. Our contribution is twofold: we reformulate the optimization problem into a sequence of decision problems, and we apply variable-fixing rules to solve these effectively. The decision problems are solved by a simple depth-first lagrangian branch-and-bound method, improved by our variable-fixing rules to prune the search tree. These rules rely on lagrangian reduced costs which we compute using an existing but little-known dynamic programming algorithm. Keywords Integer programming · Generalized assignment problem · Branch and bound · Lagrangian relaxation · Dynamic programming

Dates and versions

hal-01320026 , version 1 (23-05-2016)

Identifiers

Cite

Marius Posta, Jacques A. Ferland, Philippe Michelon. An exact method with variable fixing for solving the generalized assignment problem. Computational Optimization and Applications, 2012, ⟨10.1007/s10589-011-9432-0⟩. ⟨hal-01320026⟩

Collections

UNIV-AVIGNON LIA
45 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More