Pages that link to "Item:Q666399"
From MaRDI portal
The following pages link to Solving the minimum label spanning tree problem by mathematical programming techniques (Q666399):
Displayed 4 items.
- A hybrid metaheuristic for the minimum labeling spanning tree problem (Q1755227) (← links)
- Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles (Q2042074) (← links)
- A polyhedral approach to the generalized minimum labeling spanning tree problem (Q2329708) (← links)
- An improved flow-based formulation and reduction principles for the minimum connectivity inference problem (Q5197998) (← links)