Pages that link to "Item:Q2329708"
From MaRDI portal
The following pages link to A polyhedral approach to the generalized minimum labeling spanning tree problem (Q2329708):
Displaying 8 items.
- Solving the minimum label spanning tree problem by mathematical programming techniques (Q666399) (← links)
- Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates (Q846172) (← links)
- A mixed integer linear formulation for the minimum label spanning tree problem (Q1025265) (← links)
- A hybrid metaheuristic for the minimum labeling spanning tree problem (Q1755227) (← links)
- Local search for the minimum label spanning tree problem with bounded color classes. (Q1811627) (← links)
- Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem (Q1886801) (← links)
- On the bicriterion - minimal cost/minimal label - spanning tree problem (Q2655606) (← links)
- Finding minimum label spanning trees using cross‐entropy method (Q6065862) (← links)