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

DOI10.1016/J.COR.2023.106477MaRDI QIDQ6551077zbMATH OpenFDO

Authors Matthew E. Scherer, Raymond R. Hill, Brian J. Lunday, Bruce Cox, Edward D. White

Publication date 6 June 2024

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2023.106477

zbMATH Keywords

instance generationinstance space analysismultidemand multidimensional knapsack problemtest instances

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• 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^®
• A genetic algorithm for the multidimensional knapsack problem
• A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
• A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
• Adaptive memory search for multidemand multidimensional knapsack problems
• Alternating control tree search for knapsack/covering problems
• Black box scatter search for general classes of binary optimization problems
• Enhanced instance space analysis for the maximum flow problem
• Exploring the role of graph spectra in graph coloring algorithm performance
• Generating new test instances by evolving in instance space
• Generation techniques for linear programming instances with controllable properties
• scientific article; zbMATH DE number 5282967 (Why is no real title available?)
• scientific article; zbMATH DE number 1054947 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• Instance spaces for machine learning classification
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• Measuring instance difficulty for combinatorial optimization problems
• Needed: An Empirical Science of Algorithms
• On normalization and algorithm selection for unsupervised outlier detection
• Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures
• Problem reduction heuristic for the 0-1 multidimensional knapsack problem
• Random forests
• Synthetic optimization problem generation: show us the correlations!
• Testing heuristics: We have it all wrong
• The effects of coefficient correlation structure in two-dimensional knapsack problems on solution procedure performance
• The generation of experimental data for computational testing in optimization
• Towards objective measures of algorithm performance across instance space
• Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
• When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners
• Where are the hard knapsack problems?

Cited in

(2)

• Applying instance space analysis for metaheuristic selection to the 0-1 multidemand multidimensional knapsack problem
• Machine scheduling instance generation by reverse engineering from instance space analysis

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)