Pages that link to "Item:Q1803742"
From MaRDI portal
The following pages link to The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts (Q1803742):
Displayed 6 items.
- A branch-and-bound algorithm for the acyclic partitioning problem (Q336782) (← links)
- Orbital branching (Q623461) (← links)
- The node capacitated graph partitioning problem: A computational study (Q1290618) (← links)
- Reformulated acyclic partitioning for rail-rail containers transshipment (Q1735174) (← links)
- Improved compact formulations for a wide class of graph partitioning problems in sparse graphs (Q1751240) (← links)
- Solving Graph Partitioning Problems Arising in Tagless Cache Management (Q3195315) (← links)