A branch-and-bound algorithm for the minimum cut linear arrangement problem
type: Item
instance of: scholarly article
title: A branch-and-bound algorithm for the minimum cut linear arrangement problem
zbMATH Open document ID: 1261.90048
author: Dalius Rubliauskas
author: Gintaras Palubeckis
published in: Journal of Combinatorial Optimization
publication date: 2013-01-03T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6121558
zbMATH Keywords: graph
zbMATH Keywords: cutwidth
zbMATH Keywords: minimum cut linear arrangement
zbMATH Keywords: branch-and-bound algorithm
zbMATH Keywords: tabu search
MaRDI profile type: Publication
full work available at URL: s10878-011-9406-2
OpenAlex ID: W2053834570
cites work: Glauber dynamics on trees and hyperbolic graphs
cites work: An edge-isoperimetric problem for powers of the Petersen graph
cites work: Graph-Theoretic Concepts in Computer Science
cites work: A branch-and-cut algorithm for the equicut problem
cites work: Crossing Numbers and Cutwidths
cites work: Tabu Search—Part I
cites work: Optimal Assignments of Numbers to Vertices
cites work: Solving Graph Bisection Problems with Semidefinite Programming
cites work: Q3661483
cites work: Min Cut is NP-complete for edge weighted trees
cites work: On the dynamics of the glass transition on Bethe lattices
cites work: LINEAR LAYOUT OF GENERALIZED HYPERCUBES
cites work: Q5491984
cites work: Iterated tabu search for the maximum diversity problem
cites work: Cutwidth I: A linear time fixed parameter algorithm
cites work: Cutwidth II: Algorithms for partial w-trees of bounded degree
cites work: A polynomial algorithm for the min-cut linear arrangement of trees
DOI: 10.1007/S10878-011-9406-2
Recommended article: On minimum cuts and the linear arrangement problem
Recommended article: A variation on the min cut linear arrangement problem
Recommended article: A branch-and-bound algorithm for solving max-\(k\)-cut problem
Recommended article: Branch and bound for the cutwidth minimization problem
Recommended article: A branch-and-price-and-cut algorithm for the pattern minimization problem
Recommended article: An efficient algorithm for the minimum capacity cut problem
Recommended article: A new approach to the minimum cut problem
Recommended article: A branch-and-cut algorithm for the equicut problem
Recommended article: A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
Recommended article: A polynomial algorithm for the min-cut linear arrangement of trees
description: scientific article; zbMATH DE number 6121558