Pages that link to "Item:Q2246187"
From MaRDI portal
The following pages link to Mixed-integer programming techniques for the connected max-\(k\)-cut problem (Q2246187):
Displaying 12 items.
- A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem (Q274945) (← links)
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
- The \(\gamma\)-connected assignment problem (Q1307813) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Parliament seating assignment problems (Q2242347) (← links)
- Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
- An Integer Programming Formulation for the Maximum k-Subset Intersection Problem (Q3195319) (← links)
- A new mixed integer linear programming formulation for the maximum degree bounded connected subgraph problem (Q5279220) (← links)
- A branch-and-cut algorithm for the connected max-\(k\)-cut problem (Q6069218) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
- Vertex covering with capacitated trees (Q6179715) (← links)
