Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization
From MaRDI portal
Publication:2008804
DOI10.1016/j.amc.2018.11.051zbMath1428.05296OpenAlexW2904156165WikidataQ128811889 ScholiaQ128811889MaRDI QIDQ2008804
Arūnas Tomkevičius, Armantas Ostreika, Gintaras Palubeckis
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
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
A variable depth neighborhood search algorithm for the min-max arc crossing problem ⋮ Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A faster fixed parameter algorithm for two-layer crossing minimization
- Fast local search for single row facility layout
- A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
- A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs
- Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation
- A linear edge kernel for two-layer crossing minimization
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Variable neighbourhood search: methods and applications
- Comparing trees via crossing minimization
- Bipartite permutation graphs
- A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
- Edge crossings in drawings of bipartite 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 variable neighborhood search and simulated annealing hybrid for the profile minimization problem
- Tabu search for the dynamic bipartite drawing problem
- Variable neighborhood scatter search for the incremental graph drawing problem
- Heuristics and meta-heuristics for 2-layer straight line crossing minimization
- A tabu thresholding algorithm for arc crossing minimization in bipartite graphs
- Variable neighbourhood search for bandwidth reduction
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
- On Bipartite Drawings and the Linear Arrangement Problem
- Exact Algorithms for the Quadratic Linear Ordering Problem
- Crossing Number is NP-Complete
- Simple and Efficient Bilayer Cross Counting
- A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
- DAG—a program that draws directed graphs
- New lower bound techniques for VLSI
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization
- An SDP approach to multi-level crossing minimization
- Trees with Hamiltonian square
- A SPECIAL CROSSING NUMBER FOR BIPARTITE GRAPHS: A RESEARCH PROBLEM
- Graph Drawing
- Experiments on drawing 2-level hierarchical graphs
- Variable neighborhood search: Principles and applications
- Incremental bipartite drawing problem
