Pages that link to "Item:Q2782732"
From MaRDI portal
The following pages link to A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs (Q2782732):
Displaying 17 items.
- Extended formulations for sparsity matroids (Q304267) (← links)
- Optimal design of compact and functionally contiguous conservation management areas (Q322808) (← links)
- Extended formulations for independence polytopes of regular matroids (Q343749) (← links)
- Average case polyhedral complexity of the maximum stable set problem (Q344955) (← links)
- Compactness and flow minimization requirements in reforestation initiatives: a heuristic solution method (Q475253) (← links)
- Smaller extended formulations for the spanning tree polytope of bounded-genus graphs (Q527446) (← links)
- Extended formulations, nonnegative factorizations, and randomized communication protocols (Q745681) (← links)
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q1391297) (← links)
- Subgraph polytopes and independence polytopes of count matroids (Q1785403) (← links)
- Hidden vertices in extensions of polytopes (Q1785631) (← links)
- Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond (Q2121739) (← links)
- Limitations of the hyperplane separation technique for bounding the extension complexity of polytopes (Q2670454) (← links)
- (Q3197844) (← links)
- A note on “A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs” (Q4628047) (← links)
- Regular Matroids Have Polynomial Extension Complexity (Q5076712) (← links)
- An efficient mixed integer linear programming model for the minimum spanning tree problem (Q6162004) (← links)
- Linear-size formulations for connected planar graph partitioning and political districting (Q6181361) (← links)
