A recognition problem in converting linear programming to network flow models
A routing in a network assigns to each ordered pair of nodes a fixed path.
When either a node or a link in a fault-tolerant network fails, the communication from one node to another using this faulty element must be sent via one or more intermediate nodes along a sequence of paths determined by this routing.
An important and practical problem is how to choose a routing in the network such that inter-mediate nodes to ensure communication are small for any fault-set.
The result shows that most inverse network optimization problems with l∞ objective function can be solved in the polynomial time.
In this paper for the two-dimensional diffusion equation, the net region is divided into bands, a special kind of block.
Some of them including the existence problem, minimax problem, net representation, bend minimization, area minimization, placement problem, routing problem, etc.
A series of Petri net-based definitions were formulated for describing four types of structural errors in a rule-based system (RBS), including inconsistency, incompleteness, redundancy and circularity.
A marked ω-Petri net model of acyclic RBS was constructed.
The results showed that the diurnal course of net photosynthetic rate displayed a two-peak pattern, that of stomatal conductance displayed a hollow pattern, and that of transpiration rate displayed a signal-peak pattern.