Optimal Experimental Design for Combinatorial Problems.
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. Citation Copyright 1996 by Kluwer Academic Publishers.
Year of publication: |
1996
|
---|---|
Authors: | Crary, Selden B ; Spera, Cosimo |
Published in: |
Computational Economics. - Society for Computational Economics - SCE, ISSN 0927-7099. - Vol. 9.1996, 3, p. 241-55
|
Publisher: |
Society for Computational Economics - SCE |
Saved in:
Saved in favorites
Similar items by person
-
A structured model to manage a large number of transactions
Andronico, Alfio, (1995)
-
Distribution-free Confidence Intervals for Sampling Inequality Indices
Palmitesta, Paola,
-
Optimization models for computer data storage design: an application
Gagliardi, Marco, (1994)
- More ...