On the minimum dummy-arc problem

DOI10.1051/ro/1993270201531zbMath0774.90047OpenAlexW194802098MaRDI QIDQ4201824

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

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 graphactivity networksset-covering problemdummy activitiesactivity on arc

Mathematics Subject Classification ID

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

Related Items (4)

A reduction tree approach for the discrete time/cost trade-off problem ⋮ Activity nets: A guided tour through some recent developments ⋮ A new method for constructing a minimal PERT network ⋮ On the use of the complexity index as a measure of complexity in activity networks

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