Pages that link to "Item:Q344955"
From MaRDI portal
The following pages link to Average case polyhedral complexity of the maximum stable set problem (Q344955):
Displaying 4 items.
- Affine reductions for LPs and SDPs (Q1717229) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- Exponential Lower Bounds for Polytopes in Combinatorial Optimization (Q2796404) (← links)
- A note on “A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs” (Q4628047) (← links)
