Pages that link to "Item:Q2201641"
From MaRDI portal
The following pages link to A variable neighborhood search approach for the vertex bisection problem (Q2201641):
Displaying 10 items.
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem (Q337212) (← links)
- Variable neighborhood search for the vertex separation problem (Q339678) (← links)
- A modified VNS metaheuristic for max-bisection problems (Q939544) (← links)
- General variable neighborhood search for computing graph separators (Q1677293) (← links)
- A hybrid breakout local search and reinforcement learning approach to the vertex separator problem (Q1753627) (← links)
- Variable neighborhood descent applied to multi-way number partitioning problem (Q1791923) (← links)
- An efficient variable neighborhood search for the space-free multi-row facility layout problem (Q2242375) (← links)
- Two new integer linear programming formulations for the vertex bisection problem (Q2282825) (← links)
- Polynomial time efficient construction heuristics for vertex separation minimization problem (Q2413384) (← links)
- A general variable neighborhood search approach for the minimum load coloring problem (Q6063505) (← links)
