Pages that link to "Item:Q2195678"

The following pages link to On integer and bilevel formulations for the \(k\)-vertex cut problem (Q2195678):

Displaying 10 items.

• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
• Political districting to minimize cut edges (Q2099493) (← links)
• Models and algorithms for the weighted safe set problem (Q2686129) (← links)
• Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem (Q5106375) (← links)
• Critical node/edge detection problems on trees (Q6054014) (← links)
• Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem (Q6062886) (← links)
• A branch-and-cut algorithm for the connected max-\(k\)-cut problem (Q6069218) (← links)
• A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
• An exact method for binary fortification games (Q6167322) (← links)
• Mathematical programming formulations for the collapsed k-core problem (Q6168587) (← links)