Pages that link to "Item:Q337212"
From MaRDI portal
The following pages link to Combining intensification and diversification strategies in VNS. An application to the vertex separation problem (Q337212):
Displaying 15 items.
- General variable neighborhood search for computing graph separators (Q1677293) (← 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)
- Global sensing search for nonlinear global optimization (Q2124800) (← links)
- A variable neighborhood search approach for the vertex bisection problem (Q2201641) (← 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)
- Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies (Q2631232) (← links)
- GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem (Q2673563) (← 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)
- General variable neighborhood search for the minimum stretch spanning tree problem (Q6063503) (← links)
- Partial neighborhood local searches (Q6082175) (← links)
- Population-based iterated greedy algorithm for the S-labeling problem (Q6164608) (← links)
- Variable neighborhood search approach with intensified shake for monitor placement (Q6179684) (← links)
