Pages that link to "Item:Q2840754"

The following pages link to A variable neighbourhood search approach to the cutwidth minimization problem (Q2840754):

Displaying 9 items.

• Branch and bound for the cutwidth minimization problem (Q339558) (← links)
• A variable neighborhood search and simulated annealing hybrid for the profile minimization problem (Q1652400) (← links)
• General variable neighborhood search for computing graph separators (Q1677293) (← links)
• Scatter search for the cutwidth minimization problem (Q1761768) (← links)
• Multistart search for the cyclic cutwidth minimization problem (Q2026984) (← links)
• Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← 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)