Preventing redundant solutions in partial enumeration algorithms

DOI10.1007/BF01582107zbMath0397.68067OpenAlexW2059469563MaRDI QIDQ4181287

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

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

Cites Work

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

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