Pages that link to "Item:Q976011"
From MaRDI portal
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 3 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)
- An exact reduction technique for the k-colour shortest path problem (Q2108122) (← links)
- Multicriteria path and tree problems: discussion on exact algorithms and applications (Q4918252) (← links)
