Pages that link to "Item:Q4642478"

The following pages link to Minimum vertex blocker clique problem (Q4642478):

Displaying 37 items.

• Minimum edge blocker dominating set problem (Q319914) (← links)
• A class of algorithms for mixed-integer bilevel min-max optimization (Q330266) (← links)
• Minimum cost edge blocker clique problem (Q827246) (← links)
• Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
• Critical vertices and edges in \(H\)-free graphs (Q1730263) (← links)
• The maximum clique interdiction problem (Q1735171) (← links)
• Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← links)
• A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072) (← links)
• Blocking total dominating sets via edge contractions (Q2034793) (← links)
• Reducing graph transversals via edge contractions (Q2037191) (← links)
• Complexity and algorithms for constant diameter augmentation problems (Q2072060) (← links)
• Using edge contractions to reduce the semitotal domination number (Q2098176) (← links)
• Reducing the domination number of graphs via edge contractions and vertex deletions (Q2219962) (← links)
• Algorithms and applications for a class of bilevel MILPs (Q2283108) (← links)
• A survey of network interdiction models and algorithms (Q2294622) (← links)
• Reducing the chromatic number by vertex or edge deletions (Q2413179) (← links)
• Integer programming methods for solving binary interdiction games (Q2672065) (← links)
• Exact solution approaches for a class of bilevel fractional programs (Q2679008) (← links)
• The complexity of blocking (semi)total dominating sets with edge contractions (Q2690876) (← links)
• Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions (Q2835660) (← links)
• Contraction Blockers for Graphs with Forbidden Induced Paths (Q2947020) (← links)
• Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions (Q2988844) (← links)
• Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
• Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
• (Q5089236) (← links)
• (Q5092403) (← links)
• Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem (Q6062886) (← links)
• A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem (Q6068690) (← links)
• Logic-based Benders decomposition for wildfire suppression (Q6068720) (← links)
• Assistance and interdiction problems on interval graphs (Q6094722) (← links)
• Reducing the vertex cover number via edge contractions (Q6098145) (← links)
• Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
• On designing networks resilient to clique blockers (Q6106962) (← links)
• A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
• Reformulations and complexity of the clique interdiction problem by graph mapping (Q6558672) (← links)
• On blockers and transversals of maximum independent sets in co-comparability graphs (Q6585269) (← links)
• Distance-preserving graph compression techniques (Q6616229) (← links)