Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization

DOI10.1016/J.AMC.2018.11.051zbMATH Open1428.05296OpenAlexW2904156165WikidataQ128811889 ScholiaQ128811889MaRDI QIDQ2008804FDOQ2008804

Gintaras Palubeckis, Arūnas Tomkevičius, Armantas Ostreika

Publication date: 26 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2018.11.051

Recommendations

• A variable neighborhood search and simulated annealing hybrid for the profile minimization problem
• A tabu search algorithm for the bipartite drawing problem
• scientific article; zbMATH DE number 1054930
• A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
• A rearrangement of adjacency matrix based approach for solving the crossing minimization problem

zbMATH Keywords

simulated annealingcombinatorial optimizationvariable neighborhood searchedge crossing minimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Optimization by Simulated Annealing
• Trees with Hamiltonian square
• Variable neighborhood search: Principles and applications
• Variable neighbourhood search: methods and applications
• Bipartite permutation graphs
• On bipartite drawings and the linear arrangement problem
• A faster fixed parameter algorithm for two-layer crossing minimization
• Crossing Number is NP-Complete
• A linear edge kernel for two-layer crossing minimization
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Simple and Efficient Bilayer Cross Counting
• Fast local search for single row facility layout
• Variable neighbourhood search for bandwidth reduction
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
• Incremental bipartite drawing problem
• Heuristics and meta-heuristics for 2-layer straight line crossing minimization
• Exact algorithms for the quadratic linear ordering problem
• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
• A tabu thresholding algorithm for arc crossing minimization in bipartite graphs
• New lower bound techniques for VLSI
• A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
• Edge crossings in drawings of bipartite graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs
• Title not available (Why is that?)
• Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation
• Comparing trees via crossing minimization
• A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
• An SDP approach to multi-level crossing minimization
• Title not available (Why is that?)
• Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization
• Title not available (Why is that?)
• Experiments on drawing 2-level hierarchical graphs
• DAG—a program that draws directed graphs
• ARC crossing minimization in hierarchical digraphs with tabu search
• A new lower bound for the bipartite crossing number with applications
• A tabu search algorithm for the bipartite drawing problem
• A SPECIAL CROSSING NUMBER FOR BIPARTITE GRAPHS: A RESEARCH PROBLEM
• Graph Drawing
• Tabu search for the dynamic bipartite drawing problem
• Variable neighborhood scatter search for the incremental graph drawing problem
• A variable neighborhood search and simulated annealing hybrid for the profile minimization problem

Cited In (2)

• Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
• A variable depth neighborhood search algorithm for the min-max arc crossing problem

This page was built for publication: Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2008804)