On the generation of circuits and minimal forbidden sets

DOI10.1007/S10107-004-0512-0zbMATH Open1062.90029OpenAlexW2132514193MaRDI QIDQ1769072FDOQ1769072

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

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

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)

Cites Work

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

Cited In (8)

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

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)