Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Towards objective measures of algorithm performance across instance space
Generating new test instances by evolving in instance space
Exploring the role of graph spectra in graph coloring algorithm performance
Alternating control tree search for knapsack/covering problems
Black box scatter search for general classes of binary optimization problems
A genetic algorithm for the multidimensional knapsack problem
Instance spaces for machine learning classification
Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
Measuring instance difficulty for combinatorial optimization problems
Where are the hard knapsack problems?
Testing heuristics: We have it all wrong
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
Enhanced instance space analysis for the maximum flow problem
On normalization and algorithm selection for unsupervised outlier detection
Generation techniques for linear programming instances with controllable properties
Adaptive memory search for multidemand multidimensional knapsack problems
A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem
Synthetic Optimization Problem Generation: Show Us the Correlations!
The Generation of Experimental Data for Computational Testing in Optimization
The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance
Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures
A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
Needed: An Empirical Science of Algorithms
A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming option of CPLEX^®
Random forests
When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners

This page was built for publication: Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551077)