A note on “A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs” (Q4628047)
From MaRDI portal
scientific article; zbMATH DE number 7032890
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on “A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs” |
scientific article; zbMATH DE number 7032890 |
Statements
A note on “A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs” (English)
0 references
6 March 2019
0 references
extended formulation
0 references
extension complexity
0 references
integer programming
0 references
planar dual
0 references
planar graph
0 references
spanning arborescence
0 references
spanning tree
0 references
0 references
