๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimal experimental design for combinatorial problems

โœ Scribed by Selden B. Grary; Cosimo Spera

Publisher
Springer US
Year
1996
Tongue
English
Weight
745 KB
Volume
9
Category
Article
ISSN
1572-9974

No coin nor oath required. For personal study only.

โœฆ Synopsis

We discuss two experimental designs and show how to use them to evaluate difficult empirical combinatorial problems. We restrict our analysis here to the knapsack problem but comment more generally on the use of computational testing to analyze the performances of algorithms.

๐Ÿ“œ SIMILAR VOLUMES

Combinatorial constructions for optimal
Combinatorial constructions for optimal supersaturated designs
โœ Kai-Tai Fang; Gennian Ge; Min-Qian Liu; Hong Qin ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 241 KB

Combinatorial designs have long had substantial application in the statistical design of experiments, and in the theory of error-correcting codes. Applications in experimental and theoretical computer science, communications, cryptography and networking have also emerged in recent years. In this pap

Optimal experimental design
Optimal experimental design
โœ Valerii Fedorov ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Wiley (John Wiley & Sons) ๐ŸŒ English โš– 175 KB

## Abstract After a short historical introduction, the properties and numerical methods are the focal point of discussion. Construction of discrete and adaptive designs demand more extended exposition and are beyond the scope of this article but the information about the corresponding publications