Preventing redundant solutions in partial enumeration algorithms

DOI10.1007/BF01582107MaRDI QIDQ4181287zbMATH OpenOpenAlexFDO

Authors J. Randall Brown

Publication date 1979

Published in Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

Chromatic Number ProblemLoading ProblemsPartial Enumeration AlgorithmsPreventing Redundant SolutionsSet of Nonredundant AssignmentsSet Of Representatives for Equivalence Classes

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Coloring of graphs and hypergraphs (05C15) Discrete mathematics in relation to computer science (68R99) Boolean programming (90C09)

Cites work

• An algorithm for a class of loading problems
• An Algorithm for the Traveling Salesman Problem
• Backtrack Programming
• Chromatic Scheduling and the Chromatic Number Problem
• Integer Programming by Implicit Enumeration and Balas’ Method
• The chromatic reduction problem
• The Loading Problem

This page was built for publication: Preventing redundant solutions in partial enumeration algorithms

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