Search Results - subject:"Graph drawing"

A fast path relinking algorithm for the min-max edge crossing problem

Peng, Bo; Wu, Lunwen; Martí, Rafael; Ma, Jiangshui - In: Computers & operations research : an international journal 166 (2024), pp. 1-17

Persistent link: https://www.econbiz.de/10014564194

Tabu search tutorial : a graph drawing application

Glover, Fred; Campos, Vicente; Martí, Rafael - In: Top : an official journal of the Spanish Society of … 29 (2021) 2, pp. 319-350

Persistent link: https://www.econbiz.de/10012583705

A variable depth neighborhood search algorithm for the Min-Max Arc Crossing Problem

Wu, Xinyun; Xiong, Caiquan; Deng, Na; Xia, Dahai - In: Computers & operations research : and their … 134 (2021), pp. 1-17

Persistent link: https://www.econbiz.de/10012649570

Tabu search for min-max edge crossing in graphs

Pastore, Tommaso; Martínez-Gavara, Anna; Napoletano, … - In: Computers & operations research : and their … 114 (2020), pp. 1-15

Persistent link: https://www.econbiz.de/10012146640

Heuristics for the constrained incremental graph drawing problem

Napoletano, Antonio; Martínez-Gavara, Anna; Festa, Paola; … - In: European journal of operational research : EJOR 274 (2019) 2, pp. 710-729

Persistent link: https://www.econbiz.de/10011990193

Tabu search for the dynamic Bipartite Drawing Problem

Martí, Rafael; Martínez-Gavara, Anna; Sánchez-Oro, Jesús - In: Computers & operations research : and their … 91 (2018), pp. 1-12

Persistent link: https://www.econbiz.de/10011793484

Large directed-graph layout and its application to a million-firms economic network

Fujita, Yuji; Fujiwara, Yoshi; Sōma, Wataru - In: Evolutionary and institutional economics review 13 (2016) 2, pp. 397-408

Persistent link: https://www.econbiz.de/10011581484

From simulated annealing to stochastic continuation: a new trend in combinatorial optimization

Robini, Marc; Reissman, Pierre-Jean - In: Journal of Global Optimization 56 (2013) 1, pp. 185-215

Simulated annealing (SA) is a generic optimization method that is quite popular because of its ease of implementation and its global convergence properties. However, SA is widely reported to converge very slowly, and it is common practice to allow extra freedom in its design at the expense of...

Persistent link: https://www.econbiz.de/10010994081

Visualisierung komplexer Strukturen : Grundlagen der Darstellung mehrdimensionaler Netzwerke

Krempel, Lothar - 2005

Persistent link: https://www.econbiz.de/10004854768

Self-Organizing Maps for Drawing Large Graphs

Bonabeau, Eric; Henaux, Florian - Santa Fe Institute - 1998

graph drawing, which belongs to the general class of force-directed algorithms, allows the drawing of arbitrary weighted …

Persistent link: https://www.econbiz.de/10005260359