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

DOI10.1080/03155986.1995.11732274zbMath0838.90082OpenAlexW2403901624MaRDI QIDQ4849260

Osman Oguz, Michael J. 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

stability indexapproximation algorithmsfeasible range of decision variables

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items

Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses