Mathematical programming formulations for the collapsed k-core problem

DOI10.1016/j.ejor.2023.04.038arXiv2211.14833OpenAlexW4367317228MaRDI QIDQ6168587

Martina Cerulli, Ivana Ljubić, Carmine Sorgente, Claudia Archetti, Domenico Serra

Publication date: 11 July 2023

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

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

zbMATH Keywords

social networksbilevel optimization\(k\)-core(O) combinatorial optimization

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• A parameterized complexity view on collapsing \(k\)-cores
• Bilevel and multilevel programming: A bibliography review
• Foundations of bilevel programming
• The maximum clique interdiction problem
• A branch-and-cut algorithm for the edge interdiction clique problem
• On integer and bilevel formulations for the \(k\)-vertex cut problem
• A survey of network interdiction models and algorithms
• An overview of bilevel optimization
• From the Cover: The structure of scientific collaboration networks
• Smallest-last ordering and clustering and graph coloring algorithms
• Community structure in social and biological networks
• A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
• Fortification Against Cascade Propagation Under Uncertainty
• Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
• Interdiction Games and Monotonicity, with Application to Knapsack Problems
• Collective dynamics of ‘small-world’ networks
• Preventing Unraveling in Social Networks: The Anchored $k$-Core Problem
• A survey on mixed-integer programming techniques in bilevel optimization

This page was built for publication: Mathematical programming formulations for the collapsed k-core problem