The throughput of sequential testing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2081, Issue , 2001, Pages 280-292

  Kodialam, Murali S ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; QUADRATIC PROGRAMMING; TESTING;

ACHIEVABLE THROUGHPUTS; ADDITIONAL STRUCTURES; BINARY STRING; MAXIMUM THROUGH-PUT; QUADRATIC PROGRAMMING PROBLEMS; SEQUENTIAL TESTING; SPECIAL STRUCTURE; TEST SYSTEMS;

INTEGER PROGRAMMING;

EID: 84947265296     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45535-3_22     Document Type: Conference Paper

References (11)

1. Bazaraa, M.S., Jarvis, J.J, and Sherali, H.D., Linear Programming and Network Flows, John Wiley and Sons, 1990.
2. Bertsimas, D., and Nino-Mora, J., "Conservation laws, extended polymatroids and multi-armed bandit problems: A unified approach to indexable systems," Mathematics of Operations Research
3. Coffman, E., and Mitrani, I., "A characterization of waiting time performance realizable by single server queues," Operations Research 28, 1980, pp. 810-821.
4. Federgruen, A., and Groenevelt, H., "M/G/c Queueing systems with multiple customer classes: Characterization and control of achievable performance under non-preemptive priority rules," Management Science 34, 1988, pp. 1121-1138.
5. Federgruen, A., and Groenevelt, H., "The greedy procedure for resource allocation problems: Necessary and sufficient conditions for optimality," Operations Research 34, 1988, pp. 909-918.
6. Fujishige, S., Submodular functions and optimization, North-Holland, 1991.
7. Gelenbe, E., and Mitrani, I., Analysis and synthesis of computer systems, Academic Press, 1980.
8. Grotschel, M., Lovasz, L., and Schrijver, A., "The ellipsoid method and its consequences in combinatorial optimization," Cominatorica 1, 1981, pp. 169-197.
9. Lawler, E., and Martel, C., "Computing maximal polymatroidal network flows," Math. of Operations Research, 7, 1982, pp. 334-348.
10. Ross, K., and Yao, D., "Optimal dynamic scheduling in Jackson networks," IEEE Transaction on Automatic Control 34, 1989, pp. 47-53.
11. Welsh, D., Matroid Theory, Academic Press, 1976.