The following pages link to Multicriteria global minimum cuts (Q2509022):
Displaying 15 items.
- Unbalanced graph partitioning (Q372961) (← links)
- Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
- A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem (Q896163) (← links)
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272) (← links)
- Complexity of the min-max (regret) versions of min cut problems (Q924631) (← links)
- Cardinality constrained and multicriteria (multi)cut problems (Q1013079) (← links)
- Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty (Q1662157) (← links)
- Blocking optimal structures (Q1752656) (← links)
- Connectivity interdiction (Q1785279) (← links)
- Unbalanced graph cuts with minimum capacity (Q2515430) (← links)
- Multicriteria cuts and size-constrained \(k\)-cuts in hypergraphs (Q2689813) (← links)
- (Q5111689) (← links)
- Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs. (Q6084360) (← links)
- Obtaining approximately optimal and diverse solutions via dispersion (Q6109008) (← links)
- On the minimum \(s-t\) cut problem with budget constraints (Q6120941) (← links)