For the most recent entries see the Petri Nets Newsletter.

Maximum-weight Markings in Marked Graphs - Algorithms and Interpretations Based on the Simplex-method.

Thulasiraman, K.; Comeau, M.A.

In: IEEE Transactions on Circuits and Systems, Vol. 34, No. 12, pages 1535-1544. 1987.

Abstract: The authors show that the maximum-weight marking problem possesses as much structure as its dual, the transshipment problem of operations research. The authors present an implementation of the simplex method of linear programming for this marking problem in terms of marked graph concepts and operations.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography