On the minimum dummy-arc problem

DOI10.1051/RO/1993270201531MaRDI QIDQ4201824zbMATHOpenAlexFDO

Authors David J. Michael, Jerzy Kamburowski, Matthias F. M. Stallmann

Publication date 29 August 1993

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/105054

zbMATH Keywords

directed acyclic graphset-covering problemactivity networksdummy activitiesactivity on arc

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Recommendations

• The min-max close-enough arc routing problem
• The Minimal Feedback Arc Set Problems^*
• scientific article; zbMATH DE number 3916048
• scientific article; zbMATH DE number 3173779
• scientific article; zbMATH DE number 3927286
• On a circle-cover minimization problem
• Minimum cut with the fewest number of arcs
• The minimum dummy task problem
• scientific article; zbMATH DE number 3891429
• An exact method for the minimum feedback arc set problem

Cited in

(7)

• Optimal constructions of reversible digraphs
• On the use of the complexity index as a measure of complexity in activity networks
• Activity nets: A guided tour through some recent developments
• A new method for constructing a minimal PERT network
• Analysis of the impact of corrective actions for stochastic project networks
• scientific article; zbMATH DE number 1517143 (Why is no real title available?)
• A reduction tree approach for the discrete time/cost trade-off problem

This page was built for publication: On the minimum dummy-arc problem

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