On the generation of circuits and minimal forbidden sets

DOI10.1007/s10107-004-0512-0zbMath1062.90029OpenAlexW2132514193MaRDI QIDQ1769072

Marc Uetz, Frederik Stork

Publication date: 17 March 2005

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-004-0512-0

zbMATH Keywords

Project schedulingEnumerationCountingCircuitResource constraintsForbidden setIndependence system

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Deterministic scheduling theory in operations research (90B35) Analytic circuit theory (94C05)

Related Items (8)

On the completability of incomplete orthogonal Latin rectangles ⋮ A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations ⋮ Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions ⋮ A random key based genetic algorithm for the resource constrained project scheduling problem ⋮ Scheduling Markovian PERT networks to maximize the net present value ⋮ Project selection, scheduling and resource allocation with time dependent returns ⋮ Resource allocation by means of project networks: Dominance results ⋮ A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem

Uses Software

• PSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Scheduling of project networks
• On generating all maximal independent sets
• An algorithm for generating all maximal independent subsets of posets
• PSPLIB -- a project scheduling problem library
• The project scheduling polyhedron: Dimension, facets and lifting theorems
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
• The Complexity of the Partial Order Dimension Problem
• The Complexity of Enumeration and Reliability Problems
• Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
• Graph Classes: A Survey
• Scheduling with AND/OR Precedence Constraints
• Preselective strategies for the optimization of stochastic project networks under resource constraints
• Algorithmic approaches to preselective strategies for stochastic scheduling problems
• Dual subimplicants of positive Boolean functions

This page was built for publication: On the generation of circuits and minimal forbidden sets