A Complexity and Approximability Study of the Bilevel Knapsack Problem

DOI10.1007/978-3-642-36694-9_9zbMath1372.90088OpenAlexW196928694MaRDI QIDQ4910808

Andrea Lodi, Gerhard J. Woeginger, Margarida Carvalho, Alberto Caprara

Publication date: 19 March 2013

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36694-9_9

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Hierarchical games (including Stackelberg games) (91A65) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (max. 100)

Bilevel Knapsack with Interdiction Constraints ⋮ A class of algorithms for mixed-integer bilevel min-max optimization ⋮ Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem ⋮ An exact approach for the bilevel knapsack problem with interdiction constraints and extensions ⋮ On Bilevel Optimization with Inexact Follower ⋮ A note on linearized reformulations for a class of bilevel linear integer problems ⋮ Exact solution approach for a class of nonlinear bilevel knapsack problems ⋮ Sequential Interdiction with Incomplete Information and Learning ⋮ Improved approximation algorithms for a bilevel knapsack problem

This page was built for publication: A Complexity and Approximability Study of the Bilevel Knapsack Problem