An accelerated algorithm for the set partitioning problem

An accelerated algorithm for the set partitioning problem

0.00 Avg rating0 Votes
Article ID: iaor19931527
Country: Brazil
Volume: 1
Issue: 3
Start Page Number: 271
End Page Number: 285
Publication Date: Jan 1990
Journal: Investigacin Operativa
Authors: ,
Keywords: sets
Abstract:

This paper presents an algorithm based on the work of Campello, adding as its main feature a booster to the classical Implicit Enumeration Method. The information needed in order to implement this process is obtained during the execution of the reduction procedure without meaningful extra burden. A computational experiment is carried out to verify its promise.

Reviews

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