Enumeration of circuits and minimal forbidden sets

Frederik Stork, Marc Uetz

Research output: Contribution to conferencePaperAcademicpeer-review

1 Citation (Scopus)

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.
Original languageEnglish
Pages108-111
Number of pages4
DOIs
Publication statusPublished - Apr 2005
Event2nd Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2003 - University of Twente, Enschede, Netherlands
Duration: 14 May 200316 May 2003

Workshop

Workshop2nd Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2003
Abbreviated titleCTW
CountryNetherlands
CityEnschede
Period14/05/0316/05/03

Keywords

  • Independence system
  • Circuit
  • Enumeration
  • Minimal forbidden set

Fingerprint Dive into the research topics of 'Enumeration of circuits and minimal forbidden sets'. Together they form a unique fingerprint.

Cite this