### Abstract

Original language | English |
---|---|

Place of Publication | Enschede |

Publisher | University of Twente, Department of Applied Mathematics |

Number of pages | 9 |

Publication status | Published - 2001 |

### Publication series

Name | Memorandum |
---|---|

Publisher | Department of Applied Mathematics, University of Twente |

No. | 1587 |

ISSN (Print) | 0169-2690 |

### Fingerprint

### Keywords

- MSC-05C05
- MSC-90C11
- IR-65774
- MSC-90B10
- EWI-3407
- MSC-90C27

### Cite this

*The generalized minimum spanning tree polytope and related polytopes*. (Memorandum; No. 1587). Enschede: University of Twente, Department of Applied Mathematics.

}

*The generalized minimum spanning tree polytope and related polytopes*. Memorandum, no. 1587, University of Twente, Department of Applied Mathematics, Enschede.

**The generalized minimum spanning tree polytope and related polytopes.** / Pop, P.C.

Research output: Book/Report › Report › Other research output

TY - BOOK

T1 - The generalized minimum spanning tree polytope and related polytopes

AU - Pop, P.C.

N1 - Imported from MEMORANDA

PY - 2001

Y1 - 2001

N2 - The Generalized Minimum Spanning Tree problem denoted by GMST is a variant of the classical Minimum Spanning Tree problem in which nodes are partitioned into clusters and the problem calls for a minimum cost tree spanning at least one node from each cluster. A different version of the problem, called E-GMST arises when exactly one node from each cluster has to be visited. Both GMST problem and E-GMST problem are NP-hard problems. In this paper, we model GMST problem and E-GMST problem as integer linear programs and study the facial structure of the corresponding polytopes.

AB - The Generalized Minimum Spanning Tree problem denoted by GMST is a variant of the classical Minimum Spanning Tree problem in which nodes are partitioned into clusters and the problem calls for a minimum cost tree spanning at least one node from each cluster. A different version of the problem, called E-GMST arises when exactly one node from each cluster has to be visited. Both GMST problem and E-GMST problem are NP-hard problems. In this paper, we model GMST problem and E-GMST problem as integer linear programs and study the facial structure of the corresponding polytopes.

KW - MSC-05C05

KW - MSC-90C11

KW - IR-65774

KW - MSC-90B10

KW - EWI-3407

KW - MSC-90C27

M3 - Report

T3 - Memorandum

BT - The generalized minimum spanning tree polytope and related polytopes

PB - University of Twente, Department of Applied Mathematics

CY - Enschede

ER -