A Study on the Computational Complexity of the Bilevel Knapsack Problem

We analyze the computational complexity of three fundamental variants of the bilevel knapsack problem. All three variants are shown to be complete for the second level of the polynomial hierarchy. We also discuss the somewhat easier situation where the weight and profit coefficients in the knapsack...

Full description

Saved in:

Bibliographic Details
Published in:	SIAM journal on optimization Vol. 24; no. 2; pp. 823 - 838
Main Authors:	Caprara, Alberto, Carvalho, Margarida, Lodi, Andrea, Woeginger, Gerhard J.
Format:	Journal Article
Language:	English
Published:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2014
Subjects:	Algorithms Applied mathematics Approximation Complexity Complexity theory Computation Decision making Hierarchies Knapsack problem Mathematical analysis Optimization Polynomials
ISSN:	1052-6234, 1095-7189
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!