Implicit enumeration algorithms for the set-partitioning problem

DOI10.1007/BF01720155zbMath0442.90059OpenAlexW1980998052MaRDI QIDQ1143941

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

set-partitioning problemcomparison of algorithmscomputational experiencesbranch-and-bound conceptcolumn enumeration algorithmimplicit enumeration algorithmslower bound conceptpreordering of the variables

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Set partitioning mit linearen Randbedingungen
• An Algorithm for Large Set Partitioning Problems
• Note—A Computational Survey of Methods for the Set Covering Problem
• On the Set-Covering Problem: II. An Algorithm for Set Partitioning
• Set Partitioning: A survey
• The Set-Covering Problem: A New Implicit Enumeration Algorithm
• Integer Programming: Methods, Uses, Computations
• Coding the Lehmer pseudo-random number generator
• The Set-Partitioning Problem: Set Covering with Equality Constraints
• Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• Set Covering and Involutory Bases
• On the Set-Covering Problem
• Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems

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