Pages that link to "Item:Q339678"
From MaRDI portal
The following pages link to Variable neighborhood search for the vertex separation problem (Q339678):
Displaying 20 items.
- Two metaheuristic approaches for solving multidimensional two-way number partitioning problem (Q336995) (← links)
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem (Q337212) (← links)
- Variable neighborhood search for the maximum clique (Q705505) (← links)
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems (Q887201) (← links)
- A quality and distance guided hybrid algorithm for the vertex separator problem (Q1652081) (← 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)
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
- A general variable neighborhood search for the cyclic antibandwidth problem (Q2114825) (← links)
- A variable neighborhood search approach for the vertex bisection problem (Q2201641) (← links)
- Variable neighbourhood search for the minimum labelling Steiner tree problem (Q2267296) (← links)
- Polynomial time efficient construction heuristics for vertex separation minimization problem (Q2413384) (← links)
- Approaching the rank aggregation problem by local search-based metaheuristics (Q2423564) (← links)
- Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies (Q2631232) (← links)
- An experimental comparison of variable neighborhood search variants for the minimization of the vertex-cut in layout problems (Q2840753) (← links)
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
- Parallel variable neighborhood search for the min–max order batching problem (Q5278230) (← links)
- Linear ordering based MIP formulations for the vertex separation or pathwidth problem (Q5915912) (← links)
- Population-based iterated greedy algorithm for the S-labeling problem (Q6164608) (← links)
