A stability concept for zero-one knapsack problems and approximation algorithms

Date

1995

Authors

Oğuz, O.
Magazine, M. J.

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

BUIR Usage Stats
0
views
32
downloads

Citation Stats

Series

Abstract

The concept of reducing the feasible range of decision variables or fixing the value of the variables is extended for the knapsack problem to include sets of variables. The ease of fixing these variables is measured by a stability index. The potential use of the concept is discussed in the context of approximation algorithms. Generalization to general zero-one problems is also considered.

Source Title

INFOR : Information Systems and Operational Research

Publisher

Taylor & Francis

Course

Other identifiers

Book Title

Degree Discipline

Degree Level

Degree Name

Citation

Published Version (Please cite this version)

Language

English