Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao zbMATH Openarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article
Data sources: zbMATH Open
Claim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Updating a hybrid algorithm for set partitioning problems

descriptionPublicationkeyboard_double_arrow_right Article Publisher:Birkhäuser, Boston
Authors: Campello, R. E.;

Updating a hybrid algorithm for set partitioning problems

Abstract

The author proposes a heuristic algorithm for the set partitioning problem consisting of a combination of a primal cutting plane algorithm and an implicit enumeration algorithm applied to subproblems. The algorithm is a variation of one of Balas. Computational results are reported.

Keywords

set partitioning, Numerical mathematical programming methods, primal cutting plane algorithm, implicit enumeration algorithm, heuristic algorithm, Boolean programming, Computational results

Powered by OpenAIRE graph
Found an issue? Give us feedback