Arc Crossing Minimization in Hierarchical Digraphs With Tabu Search

Computers and Operations Research - United Kingdom
doi 10.1016/s0305-0548(96)00083-4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

An Alternative Method to Crossing Minimization on Hierarchical Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Constructions for Arc-Transitive Digraphs

Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
1995English

Investigating Edge-Reordering Procedures in a Tabu Search Algorithm for the Capacitated Arc Routing Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Minimally Strong Subgraph (K,l)-Arc-Connected Digraphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2020English

Tabu Search Based Circuit Optimization

Engineering Applications of Artificial Intelligence
ControlSystems EngineeringElectricalArtificial IntelligenceElectronic Engineering
2002English

On the Optimality of 3-Restricted Arc Connectivity for Digraphs and Bipartite Digraphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Combined Electromagnetism-Like Algorithm With Tabu Search to Scheduling

Advances in Computational Intelligence and Robotics
English

University Timetable Generator Using Tabu Search

Journal of Computer and Communications
2016English

Tabu Search for Human Pose Recognition

2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy