A new modeling and solution approach for the set-partitioning problem |
| |
| Authors: | Mark Lewis Gary Kochenberger Bahram Alidaee |
| |
| Affiliation: | 1. School of Professional Studies, Missouri Western State University, St. Joseph, MO;2. School of Business, University of Colorado, Denver, CO;3. School of Business, University of Mississippi, University, MS |
| |
| 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. |
| |
| Keywords: | Set partitioning Combinatorial problems Metaheuristics |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
