The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance
From MaRDI portal
Publication:3116733
DOI10.1287/mnsc.46.2.302.11930zbMath1231.90323OpenAlexW2105008868MaRDI QIDQ3116733
Charles H. Reilly, Raymond R. Hill
Publication date: 12 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.46.2.302.11930
Related Items (14)
A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances ⋮ Towards objective measures of algorithm performance across instance space ⋮ Exploring the role of graph spectra in graph coloring algorithm performance ⋮ Features for the 0-1 knapsack problem based on inclusionwise maximal solutions ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ Generation techniques for linear programming instances with controllable properties ⋮ What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO ⋮ Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem ⋮ Shift-and-merge technique for the DP solution of the time-constrained backpacker problem ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ Improved results on the 0--1 multidimensional knapsack problem ⋮ A Meta-RaPS for the early/tardy single machine scheduling problem ⋮ Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis ⋮ The multidimensional 0-1 knapsack problem -- bounds and computational aspects
This page was built for publication: The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance
