Pages that link to "Item:Q3167633"
From MaRDI portal
The following pages link to On the Solution of a Graph Partitioning Problem under Capacity Constraints (Q3167633):
Displaying 15 items.
- An extended edge-representative formulation for the \(K\)-partitioning problem (Q325479) (← links)
- Stochastic graph partitioning: quadratic versus SOCP formulations (Q331990) (← links)
- Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (Q335322) (← links)
- Capacitated max-batching with interval graph compatibilities (Q899311) (← links)
- Improved compact formulations for a wide class of graph partitioning problems in sparse graphs (Q1751240) (← links)
- Integer programming formulations and efficient local search for relaxed correlation clustering (Q2052402) (← links)
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
- A graph theoretic approach to the slot allocation problem (Q2362198) (← links)
- An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints (Q2383757) (← links)
- (Q3807893) (← links)
- Improved linearized models for graph partitioning problem under capacity constraints (Q4594838) (← links)
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem (Q5106375) (← links)
- A branch-and-cut algorithm for the connected max-\(k\)-cut problem (Q6069218) (← links)
- The <scp><i>K</i>‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> (Q6092622) (← links)
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)
