Pages that link to "Item:Q2840693"
From MaRDI portal
The following pages link to An effective compact formulation of the max cut problem on sparse graphs (Q2840693):
Displaying 5 items.
- Improved compact formulations for metric and cut polyhedra (Q325413) (← links)
- Local search inequalities (Q1751111) (← links)
- Deriving compact extended formulations via LP-based separation techniques (Q5892024) (← links)
- Deriving compact extended formulations via LP-based separation techniques (Q5925168) (← links)
- An extended formulation for the 1‐wheel inequalities of the stable set polytope (Q6068534) (← links)
