Pages that link to "Item:Q1025265"

The following pages link to A mixed integer linear formulation for the minimum label spanning tree problem (Q1025265):

Displaying 16 items.

• Solving the minimum label spanning tree problem by mathematical programming techniques (Q666399) (← links)
• Carousel greedy: a generalized greedy algorithm with applications in optimization (Q1652355) (← 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)
• An exact reduction technique for the k-colour shortest path problem (Q2108122) (← links)
• Complexity and approximation results on the shared transportation problem (Q2149862) (← links)
• A polyhedral approach to the generalized minimum labeling spanning tree problem (Q2329708) (← links)
• On the bicriterion - minimal cost/minimal label - spanning tree problem (Q2655606) (← links)
• Improved approaches to solve the one-to-one skewgram problem (Q2669687) (← links)
• (Q3197844) (← links)
• Multicriteria path and tree problems: discussion on exact algorithms and applications (Q4918252) (← links)
• OMEGA one multi ethnic genetic approach (Q5963233) (← links)
• Finding minimum label spanning trees using cross‐entropy method (Q6065862) (← links)
• An efficient mixed integer linear programming model for the minimum spanning tree problem (Q6162004) (← links)
• On the shared transportation problem: computational hardness and exact approach (Q6610092) (← links)