Publication | Closed Access
On some LP problems for performance evaluation of timed marked graphs
16
Citations
8
References
1994
Year
Mathematical ProgrammingEngineeringPlanar GraphNetwork AnalysisEducationComputational ComplexityDiscrete OptimizationOperations ResearchTimed Marked GraphsStructural Graph TheoryDiscrete MathematicsTimed SystemCombinatorial OptimizationOptimizationLinear OptimizationGeometric Graph TheoryLp ProblemsComputer ScienceGraph AlgorithmInteger ProgrammingGraph TheoryScheduling ProblemReal-time SystemsLinear ProgrammingExtremal Graph Theory
Three linear programming (LP) formulations are known for performance evaluation of timed marked graphs. Two of these are dual. This paper shows that the third problem is isomorphic to one of the dual problems. An illustrative example is also given.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
| Year | Citations | |
|---|---|---|
Page 1
Page 1