In this paper we focus on a particular variant of the problem, the Min-Max GDP, consisting in the minimization of the maximum crossing among all egdes.

Sep 2, 2019 · The main contributions of this work are: (i) extension of the mathematical programming model in the case of multilayer layered graphs, (ii) ...

This paper describes an automated tabu search based method for drawing general graph layouts with straight lines. To our knowledge, this is the first time tabu ...

We propose a heuristic algorithm based on the tabu search methodology to obtain high-quality solutions. Extensive experimentation on an established benchmark ...

Tabu Search algorithm for the Min-Max Graph Drawing Problem, as originally described in "Tabu Search for Min-Max Edge Crossing in Graphs" by Tommaso Pastore ...

Abstract—This paper describes an automated tabu search based method for drawing general simple graph layouts with straight lines. To our knowledge, this is ...

Tabu search is an optimization methodology that guides a local heuristic search procedure to explore the solution space beyond local optimality.

Fixed linear crossing minimization problem. The problem of finding a linear em- bedding of a graph with the minimum number of edge crossings under a specified.

Abstract. This work proposes a new learning-to-search bench- mark and uses AI to discover new mathematical knowledge related to an open conjecture of Erd˝os.

This paper deals with the strongly NP-hard minmax regret version of the minimum spanning tree problem with interval costs. The best known exact algorithms ...