A Stability Concept For Zero-One Knapsack Problems And Approximation Algorithms

DOI10.1080/03155986.1995.11732274MaRDI QIDQ4849260zbMATH OpenOpenAlexFDO

Authors Osman Oguz, Michael Magazine

Publication date 30 May 1996

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

Full work available at URL http://hdl.handle.net/11693/48771

zbMATH Keywords

approximation algorithmsfeasible range of decision variablesstability index

Mathematics Subject Classification ID

Boolean programming (90C09)

Recommendations

• scientific article; zbMATH DE number 1408349
• Approximate and exact algorithms for the fixed-charge knapsack problem
• A new approximation algorithm for the knapsack problem
• Some computational results on real 0-1 knapsack problems

Cited in

(2)

• scientific article; zbMATH DE number 1408349 (Why is no real title available?)
• Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses

This page was built for publication: A Stability Concept For Zero-One Knapsack Problems And Approximation Algorithms

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