A computational study of exact knapsack separation for the generalized assignment problem

Authors:
Pasquale Avella;Maurizio Boccia;Igor Vasilyev
Affiliations:
RCOST--Research Center on Software Technology, Università del Sannio, Benevento, Italy 82100;RCOST--Research Center on Software Technology, Università del Sannio, Benevento, Italy 82100;Institute of System Dynamics and Control Theory, Siberian Branch of Russian Academy of Sciences, Irkutsk, Russia 664033
Venue:
Computational Optimization and Applications
Year:
2010

Citing 8
Cited 1

The generalized assignment problem: valid inequalities and facets

Mathematical Programming: Series A and B
(1,k)-configuration facets for the generalized assignment problem

Mathematical Programming: Series A and B
A genetic algorithm for the generalised assignment problem

Computers and Operations Research
Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach

INFORMS Journal on Computing
An Ejection Chain Approach for the Generalized Assignment Problem

INFORMS Journal on Computing
A branch-and-price algorithm for the capacitated p-median problem

Networks
A convex-analysis perspective on disjunctive cuts

Mathematical Programming: Series A and B
A family of inequalities for the generalized assignment polytope

Operations Research Letters

A Lagrangian heuristic for sprint planning in agile software development

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Generalized Assignment Problem is a well-known NP-hard combinatorial optimization problem which consists of minimizing the assignment costs of a set of jobs to a set of machines satisfying capacity constraints. Most of the existing algorithms are of a Branch-and-Price type, with lower bounds computed through Dantzig---Wolfe reformulation and column generation.In this paper we propose a cutting plane algorithm working in the space of the variables of the basic formulation, whose core is an exact separation procedure for the knapsack polytopes induced by the capacity constraints. We show that an efficient implementation of the exact separation procedure allows to deal with large-scale instances and to solve to optimality several previously unsolved instances.