Implicit enumeration algorithms for the set-partitioning problem

DOI10.1007/BF01720155MaRDI QIDQ1143941zbMATH OpenOpenAlexFDO

Authors S. H. Smith

Publication date 1980

Published in OR Spektrum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01720155

zbMATH Keywords

comparison of algorithmscomputational experiencesbranch-and-bound conceptcolumn enumeration algorithmimplicit enumeration algorithmslower bound conceptpreordering of the variablesset-partitioning problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Boolean programming (90C09)

Cites work

• scientific article; zbMATH DE number 3410784 (Why is no real title available?)
• An Algorithm for Large Set Partitioning Problems
• Coding the Lehmer pseudo-random number generator
• Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• Integer Programming: Methods, Uses, Computations
• Note—A Computational Survey of Methods for the Set Covering Problem
• On the Set-Covering Problem
• On the Set-Covering Problem: II. An Algorithm for Set Partitioning
• Set Covering and Involutory Bases
• Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
• Set Partitioning: A survey
• Set partitioning mit linearen Randbedingungen
• The Set-Covering Problem: A New Implicit Enumeration Algorithm
• The Set-Partitioning Problem: Set Covering with Equality Constraints

This page was built for publication: Implicit enumeration algorithms for the set-partitioning problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1143941)