The following pages link to Max-cut in circulant graphs (Q1201272):
Displaying 6 items.
- Application of cut polyhedra. I (Q1891019) (← links)
- A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832) (← links)
- A note on the 2-circulant inequalities for the MAX-cut problem (Q2417185) (← links)
- Generalised 2-circulant inequalities for the max-cut problem (Q2670485) (← links)
- The Boolean Quadric Polytope (Q5050144) (← links)
- On the bond polytope (Q6060889) (← links)
