Pages that link to "Item:Q3116733"
From MaRDI portal
The following pages link to The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance (Q3116733):
Displayed 14 items.
- Towards objective measures of algorithm performance across instance space (Q336954) (← links)
- Exploring the role of graph spectra in graph coloring algorithm performance (Q403572) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem (Q1761939) (← links)
- Shift-and-merge technique for the DP solution of the time-constrained backpacker problem (Q1762021) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Improved results on the 0--1 multidimensional knapsack problem (Q1776956) (← links)
- Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis (Q2027074) (← links)
- Generation techniques for linear programming instances with controllable properties (Q2220897) (← links)
- A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances (Q2629710) (← links)
- A Meta-RaPS for the early/tardy single machine scheduling problem (Q3055652) (← links)
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO (Q5136083) (← links)
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions (Q6168585) (← links)