On the generation of circuits and minimal forbidden sets
type: Item
instance of: scholarly article
title: On the generation of circuits and minimal forbidden sets
zbMATH Open document ID: 1062.90029
author: Frederik Stork
author: Marc Uetz
published in: Mathematical Programming. Series A. Series B
publication date: 2005-03-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 94C05
zbMATH DE Number: 2146831
zbMATH Keywords: Independence system
zbMATH Keywords: Circuit
zbMATH Keywords: Enumeration
zbMATH Keywords: Counting
zbMATH Keywords: Project scheduling
zbMATH Keywords: Resource constraints
zbMATH Keywords: Forbidden set
describes a project that uses: PSPLIB
MaRDI profile type: Publication
full work available at URL: s10107-004-0512-0
OpenAlex ID: W2132514193
cites work: The project scheduling polyhedron: Dimension, facets and lifting theorems
cites work: An algorithm for generating all maximal independent subsets of posets
cites work: Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
cites work: Dual subimplicants of positive Boolean functions
cites work: Graph Classes: A Survey
cites work: Q4198056
cites work: Algorithmic approaches to preselective strategies for stochastic scheduling problems
cites work: Preselective strategies for the optimization of stochastic project networks under resource constraints
cites work: On generating all maximal independent sets
cites work: PSPLIB -- a project scheduling problem library
cites work: Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
cites work: Q3686754
cites work: Scheduling with AND/OR Precedence Constraints
cites work: Q4298260
cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
cites work: Scheduling of project networks
cites work: The complexity of computing the permanent
cites work: The Complexity of Enumeration and Reliability Problems
cites work: The Complexity of the Partial Order Dimension Problem
DOI: 10.1007/S10107-004-0512-0
description: scientific article; zbMATH DE number 2146831