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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	SIAM journal on optimization Ročník 24; číslo 2; s. 823 - 838
Hlavní autori:	Caprara, Alberto, Carvalho, Margarida, Lodi, Andrea, Woeginger, Gerhard J.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2014
Predmet:	Algorithms Applied mathematics Approximation Complexity Complexity theory Computation Decision making Hierarchies Knapsack problem Mathematical analysis Optimization Polynomials
ISSN:	1052-6234, 1095-7189
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!