Synthetic Optimization Problem Generation: Show Us the Correlations!
Abbreviated Journal Title
INFORMS J. Comput.
random variable generation; correlation; 0-1 knapsack problem; generalized assignment problem; capital budgeting problem; set-covering; problem; 0-1 KNAPSACK-PROBLEM; GENERALIZED ASSIGNMENT PROBLEM; SINGLE-MACHINE; ALGORITHMS; PERFORMANCE; BOUNDS; Computer Science, Interdisciplinary Applications; Operations Research &; Management Science
In many computational experiments, correlation is induced between certain types of coefficients in synthetic (or simulated) instances of classical optimization problems. Typically, the correlations that are induced are only qualified-that is, described by their presumed intensity. We quantify the population correlations induced under several strategies for simulating 0-1 knapsack problem instances and also for correlation-induction approaches used to simulate instances of the generalized assignment, capital budgeting (or multidimensional knapsack), and set-covering problems. We discuss implications of these correlation-induction methods for previous and future computational experiments on simulated optimization problems.
Informs Journal on Computing
"Synthetic Optimization Problem Generation: Show Us the Correlations!" (2009). Faculty Bibliography 2000s. 2046.