Pages that link to "Item:Q325409"

The following pages link to The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut (Q325409):

Displaying 11 items.

• Polyhedral study of the connected subgraph problem (Q468440) (← links)
• \(k\)-edge subgraph problems (Q1356515) (← links)
• On imposing connectivity constraints in integer programs (Q1683690) (← links)
• On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem (Q1789587) (← links)
• Physical ZKP for connected spanning subgraph: applications to bridges puzzle and other problems (Q2152094) (← links)
• Mixed-integer programming techniques for the connected max-\(k\)-cut problem (Q2246187) (← links)
• On the \(k\)-edge-incident subgraph problem and its variants (Q2446891) (← links)
• The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation (Q2506819) (← links)
• Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut (Q2583145) (← links)
• A branch-and-cut algorithm for the k-edge connected subgraph problem (Q3057129) (← links)
• Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) (← links)