A variable neighborhood search approach for the vertex bisection problem
DOI10.1016/J.INS.2018.09.063zbMATH Open1442.68218OpenAlexW2895172747WikidataQ129142233 ScholiaQ129142233MaRDI QIDQ2201641FDOQ2201641
Abraham Duarte, J. Manuel Colmenar, Alberto Herrán
Publication date: 29 September 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2018.09.063
Recommendations
- Two new integer linear programming formulations for the vertex bisection problem
- Variable neighborhood search for the vertex separation problem
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
- A modified VNS metaheuristic for max-bisection problems
- An effective multilevel tabu search approach for balanced graph partitioning
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- An efficient memetic algorithm for the graph partitioning problem
- A hybrid heuristic for the \(p\)-median problem
- Variable neighborhood search: Principles and applications
- Variable neighbourhood search: methods and applications
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- Greedy randomized adaptive search procedures
- Variable neighborhood search strategies for the order batching problem
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
- Variable neighborhood search for the vertex separation problem
- The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width
- Vertex Bisection is Hard, too
- Parallel variable neighbourhood search strategies for the cutwidth minimization problem
- General variable neighborhood search for computing graph separators
Cited In (5)
- A general variable neighborhood search approach for the minimum load coloring problem
- An efficient variable neighborhood search for the space-free multi-row facility layout problem
- Variable neighborhood descent applied to multi-way number partitioning problem
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
- A modified VNS metaheuristic for max-bisection problems
This page was built for publication: A variable neighborhood search approach for the vertex bisection problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201641)
