Some Complexity Issues In A Class Of Knapsack Problems: What Makes A Knapsack Problem “Hard”?

DOI10.1080/03155986.1994.11732246zbMath0830.90104OpenAlexW3125066015MaRDI QIDQ4313819

Dmitry Krass, Gerhard Sorger, Suresh P. Sethi

Publication date: 18 December 1994

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1994.11732246

zbMATH Keywords

knapsack-like problems

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Boolean programming (90C09)

This page was built for publication: Some Complexity Issues In A Class Of Knapsack Problems: What Makes A Knapsack Problem “Hard”?