Pages that link to "Item:Q976011"

The following pages link to Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems (Q976011):

Displaying 9 items.

• Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems (Q339582) (← links)
• Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem (Q1027523) (← links)
• Variable neighborhood search for the degree-constrained minimum spanning tree problem (Q1348252) (← links)
• Local search for the minimum label spanning tree problem with bounded color classes. (Q1811627) (← links)
• An exact reduction technique for the k-colour shortest path problem (Q2108122) (← links)
• Variable neighbourhood search for the minimum labelling Steiner tree problem (Q2267296) (← links)
• Variable neighbourhood search for the \(k\)-labelled spanning forest problem (Q2631224) (← links)
• (Q3369027) (← links)
• Multicriteria path and tree problems: discussion on exact algorithms and applications (Q4918252) (← links)