Approximation algorithms for interdiction problem with packing constraints

DOI10.4230/LIPICS.ICALP.2022.39MaRDI QIDQ6560826zbMATH OpenFDO

Authors Lin Chen, Xiao-Yu Wu, Guochuan Zhang

Publication date 24 June 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2022.39

zbMATH Keywords

bilevel integer programminginterdiction constraintsknapsack

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cited in

(4)

• Approximation algorithms for two extensions of min-k-union
• Bilevel adversarial scheduling problem on parallel machines
• On extensions of min-k-union
• A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints

This page was built for publication: Approximation algorithms for interdiction problem with packing constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560826)