### Table 1: Linear programming problem.

in Operational Analysis of Timed Petri Nets and Application to the Computation of Performance Bounds

1993

Cited by 12

### Table 7: Linear Program for the Centralized Problem.

2005

Cited by 3

### Table 1: Comparison of Delaunayzation cost for di erent limits on size of the linear programming problem (1).

1999

"... In PAGE 16: ...8 seconds (for limit on the size of the linear programming problem (1) set to 20). Table1 summarizes e ects of setting a limit on the largest number of unknowns for which the linear programming (LP) problem of equation (1) is actually solved. Although the LP software package we have used is perhaps 3Designed by Gil Benavides at Sandia National Laboratories... ..."

Cited by 6

### Table 3.1: Linear programming problem size for the most time-instensive basic block

2000

Cited by 59

### Table 1: Linear programming problem. maximize [or minimize] f( M;~x) subject to

in Operational Analysis of Timed Petri Nets and Application to the Computation of Performance Bounds

1993

Cited by 12

### Table I. Comparison of Delaunayzation cost for di erent limits on size of the linear programming problem (1).

### Table 3 Computational results - linear programming relaxation Problem

1990

"... In PAGE 13: ...=l, ... ,m, corresponding to some of the smaller problems tested on the integer program ming algorithm. Table3 summarizes the results. We can make the following observations about the runs in table 3: - Contrary to Hooker [9], where single literal clauses were admitted, the simplex method failed to find integral solutions to the linear programming relaxations Table 3 Computational results - linear programming relaxation Problem ... ..."

Cited by 41

### Table 1. Comparison of value iteration and linear programming on sample problems.

in Play to test

2005

"... In PAGE 12: ... We are currently investigating exten- sions of the value iteration method as well as the use of graph compression explained above. Table1 compares the running times of the value iteration and simplex method for test graphs generated from the following two sample problems. Both examples are available in the Spec Explorer distribution [1].... ..."

Cited by 9

### Table 8: Approximate Linear Programming Algorithm for the Decentralized Problem.

2005

Cited by 3