A new modeling and solution approach for the set-partitioning problem

A new modeling and solution approach for the set-partitioning problem

0.00 Avg rating0 Votes
Article ID: iaor20091304
Country: United Kingdom
Volume: 35
Issue: 3
Start Page Number: 807
End Page Number: 813
Publication Date: Mar 2008
Journal: Computers and Operations Research
Authors: , ,
Keywords: programming: quadratic
Abstract:

The set-partitioning problem (SPP) is widely known for both its application potential and its computational challenge. This NP-hard problem is known to pose considerable difficulty for classical solution methods such as those based on LP technologies. In recent years, the unconstrained binary quadratic program has proven to perform well as a unified modeling and solution framework for a variety of IP problems. In this paper we illustrate how this unified framework can be applied to SPP. Computational experience is presented, illustrating the attractiveness of the approach.

Reviews

Required fields are marked *. Your email address will not be published.