Complexity indices for the multidimensional knapsack problem

DOI10.1007/s10100-018-0569-0OpenAlexW2883649912WikidataQ129495464 ScholiaQ129495464MaRDI QIDQ2045626

Hugo Ubilla, Felipe Sepúlveda, Carlos Herrera, Iván Derpich

Publication date: 13 August 2021

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-018-0569-0

zbMATH Keywords

integer programmingmultidimensional knapsack problemcomplexity index

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• CPLEX
• OR-Library
• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A heuristic algorithm for the multidimensional zero-one knapsack problem
• A multi-level search strategy for the 0-1 multidimensional knapsack problem
• Kernel search: a general heuristic for the multi-dimensional knapsack problem
• An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
• A genetic algorithm for the multidimensional knapsack problem
• On the use of the complexity index as a measure of complexity in activity networks
• New trends in exact algorithms for the \(0-1\) knapsack problem
• A procedure-based heuristic for 0-1 multiple knapsack problems
• CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem
• A mathematical model for selecting mixed models with due dates
• A multidimensional knapsack model for asset-backed securitization
• Partial enumeration in heuristics for some combinatorial optimization problems
• Incorporating Condition Measures in the Context of Combinatorial Optimization
• On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System

This page was built for publication: Complexity indices for the multidimensional knapsack problem