Structure of the submarking-reachability problem and network programming

DOI10.1109/31.1702zbMath0648.90081OpenAlexW2163522570MaRDI QIDQ3793963

Krishnaiyan Thulasiraman, M. A. Comeau

Publication date: 1988

Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/31.1702

zbMATH Keywords

marked graphsworst-case time complexitytesting feasibilitydual transshipment problemspecial class of Petri nets

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

This page was built for publication: Structure of the submarking-reachability problem and network programming