Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks

DOI10.1016/j.ejor.2021.05.008zbMath1487.90493arXiv2005.08039OpenAlexW3025864033MaRDI QIDQ2242189

Yanyan Li

Publication date: 9 November 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.08039

zbMATH Keywords

combinatorial optimizationsocial networksbilevel programminginterdiction problemsinfluence minimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30) Mixed integer programming (90C11) Minimax problems in mathematical programming (90C47) Hierarchical games (including Stackelberg games) (91A65)

Related Items (3)

A Branch-and-Cut Algorithm for Submodular Interdiction Games ⋮ Logic-based Benders decomposition for wildfire suppression ⋮ An exact method for binary fortification games

Cites Work

• Unnamed Item
• A class of algorithms for mixed-integer bilevel min-max optimization
• An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
• Enhanced exact algorithms for discrete bilevel linear problems
• The budget constrained \(r\)-interdiction median problem with capacity expansion
• Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
• Some properties of the bilevel programming problem
• Deterministic network interdiction
• A cutting-plane algorithm for solving a weighted influence interdiction problem
• A bilevel mixed-integer program for critical infrastructure protection planning
• An exact solution approach for the interdiction median problem with fortification
• The polynomial hierarchy and a simple model for competitive analysis
• A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
• A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
• Shortest-path network interdiction
• Packing Interdiction and Partial Covering Problems
• The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
• Interdiction Games and Monotonicity, with Application to Knapsack Problems
• The Mixed Integer Linear Bilevel Programming Problem
• Collective dynamics of ‘small-world’ networks
• A Backward Sampling Framework for Interdiction Problems with Fortification
• Benchmarking optimization software with performance profiles.

This page was built for publication: Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks