On the generation of circuits and minimal forbidden sets

DOI10.1007/S10107-004-0512-0MaRDI QIDQ1769072zbMATHOpenAlexFDO

Authors Frederik Stork, Marc Uetz

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

EnumerationCountingProject schedulingCircuitResource constraintsForbidden setIndependence system

Mathematics Subject Classification ID

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

Recommendations

• Scheduling with forbidden sets
• Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems
• An ordered independence system and its applications to scheduling problems
• Algorithms and Computation
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems

Cites work

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

Cited in

(8)

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

Describes a project that uses

Uses Software

• PSPLIB

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1769072)