Pages that link to "Item:Q2840754"
From MaRDI portal
The following pages link to A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem (Q2840754):
Displaying 4 items.
- General variable neighborhood search for computing graph separators (Q1677293) (← links)
- Packing a fixed number of identical circles in a circular container with circular prohibited areas (Q2329665) (← links)
- A general variable neighborhood search approach for the minimum load coloring problem (Q6063505) (← links)
- Population-based iterated greedy algorithm for the S-labeling problem (Q6164608) (← links)
