Pages that link to "Item:Q1751240"
From MaRDI portal
The following pages link to Improved compact formulations for a wide class of graph partitioning problems in sparse graphs (Q1751240):
Displaying 10 items.
- Stochastic graph partitioning: quadratic versus SOCP formulations (Q331990) (← links)
- A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs (Q518138) (← links)
- Compact mathematical formulation for graph partitioning (Q959488) (← links)
- An exact approach for the balanced \(k\)-way partitioning problem with weight constraints and its application to sports team realignment (Q1631652) (← links)
- Exploiting sparsity for the min \(k\)-partition problem (Q2175445) (← links)
- Redundant constraints in the standard formulation for the clique partitioning problem (Q2257087) (← links)
- An effective compact formulation of the max cut problem on sparse graphs (Q2840693) (← links)
- Reduced‐size formulations for metric and cut polyhedra in sparse graphs (Q4565778) (← links)
- Improved linearized models for graph partitioning problem under capacity constraints (Q4594838) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
