Enumeration of circuits and minimal forbidden sets

Share/Save/Bookmark

Stork, F. and Uetz, M.J. (2005) Enumeration of circuits and minimal forbidden sets. In: 2nd Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 14-16 May, 2003, Enschede, The Netherlands (pp. pp. 108-111).

[img] PDF
Restricted to UT campus only
: Request a copy
256kB
Abstract:In resource-constrained scheduling, it is sometimes important to know all inclusion-minimal subsets of jobs that must not be scheduled simultaneously. These so-called minimal forbidden sets are given implicitly by a linear inequality system, and can be interpreted more generally as the circuits of a particular independence system. We present several complexity results related to computation, enumeration, and counting of the circuits of an independence system. On this account, we also propose a backtracking algorithm that enumerates all minimal forbidden sets for resource constrained scheduling problems.

Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/62221
Official URL:http://dx.doi.org/10.1016/S1571-0653(04)00449-4
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page