Multilevel Approaches for the Critical Node Problem (Q4994170): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/opre.2020.2014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3125629652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the most vital arcs in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for the Bilevel Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The most vital nodes with respect to independent set and vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-level reformulation of the bilevel Knapsack problem using dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel Knapsack with Interdiction Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhanced exact algorithms for discrete bilevel linear problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bilevel programming problem: reformulations, constraint qualifications and optimality conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Interdiction and Partial Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the critical node problem over trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3614015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Cuts for Bilevel Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interdiction Games and Monotonicity, with Application to Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Parameterized Complexity of Cutting a Few Vertices from a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: 0-1 reformulations of the multicommodity capacitated network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing the Weight of Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal interdiction policy for a flow network / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Branch-and-Bound Rules for Linear Bilevel Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixed-integer bilevel programming approach for a competitive prioritized set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting-plane algorithm for solving a weighted influence interdiction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On short paths interdiction problems: Total and node-wise limited interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Backward Sampling Framework for Interdiction Problems with Fortification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mixed Integer Linear Bilevel Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The network inhibition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the <i>n</i> Most Vital Links in Flow Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bilevel mixed-integer program for critical infrastructure protection planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact solution approach for the interdiction median problem with fortification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact interdiction models and algorithms for disconnecting networks via node deletions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survivable network design under optimal and heuristic interdiction scenarios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network flow interdiction on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity interdiction / rank
 
Normal rank

Latest revision as of 01:00, 26 July 2024

scientific article; zbMATH DE number 7360290
Language Label Description Also known as
English
Multilevel Approaches for the Critical Node Problem
scientific article; zbMATH DE number 7360290

    Statements

    Multilevel Approaches for the Critical Node Problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 June 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    multilevel programming
    0 references
    critical node problem
    0 references
    firefighter problem
    0 references
    mixed-integer programming
    0 references
    defender-attacker-defender
    0 references
    0 references
    0 references
    0 references