Pages that link to "Item:Q4628047"
From MaRDI portal
The following pages link to A note on “A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs” (Q4628047):
Displaying 4 items.
- Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond (Q2121739) (← links)
- Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
- Imposing Contiguity Constraints in Political Districting Models (Q5080650) (← links)
- Linear-size formulations for connected planar graph partitioning and political districting (Q6181361) (← links)