Variable neighborhood descent for the incremental graph drawing
type: Item
instance of: scholarly article
title: Variable neighborhood descent for the incremental graph drawing
zbMATH Open document ID: 1388.90119
author: Jesús Sánchez-Oro
author: Abraham Duarte
author: Anna Martínez-Gavara
author: Manuel Laguna
author: Rafael Martí
publication date: 2018-01-04T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6821812
zbMATH Keywords: incremental graph drawing
zbMATH Keywords: variable neighborhood descent
zbMATH Keywords: metaheuristics
MaRDI profile type: Publication
full work available at URL: j.endm.2017.03.024
OpenAlex ID: W2606775109
cites work: Parallel variable neighbourhood search strategies for the cutwidth minimization problem
cites work: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
cites work: Crossing Number is NP-Complete
cites work: Variable neighbourhood search: Methods and applications
cites work: ARC crossing minimization in hierarchical digraphs with tabu search
cites work: A tabu search algorithm for the bipartite drawing problem
cites work: Incremental bipartite drawing problem
DOI: 10.1016/J.ENDM.2017.03.024
description: scientific article; zbMATH DE number 6821812