Branch and bound for the cutwidth minimization problem
type: Item
instance of: scholarly article
title: Branch and bound for the cutwidth minimization problem
zbMATH Open document ID: 1349.90820
author: Rafael Martí
author: Juan J. Pantrigo
author: Abraham Duarte
author: Eduardo G. Pardo
published in: Computers \& Operations Research
publication date: 2016-11-11T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6651722
zbMATH Keywords: cutwidth
zbMATH Keywords: branch-and-bound algorithm
zbMATH Keywords: integer programming
describes a project that uses: GRASP
describes a project that uses: CPLEX
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.cor.2012.05.016
OpenAlex ID: W2160467939
Wikidata QID: Q57856091
cites work: Optimal Linear Ordering
cites work: Decorous lower bounds for minimum linear arrangement
cites work: A probabilistic heuristic for a computationally difficult set covering problem
cites work: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
cites work: An annotated bibliography of GRASP – Part I: Algorithms
cites work: An annotated bibliography of GRASP-Part II: Applications
cites work: Q3292914
cites work: Some simplified NP-complete graph problems
cites work: Q4354785
cites work: Optimal numberings and isoperimetric problems on graphs
cites work: Optimal linear labelings and eigenvalues of graphs
cites work: A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
cites work: Topological Bandwidth
cites work: On minimizing width in linear layouts
cites work: A branch and bound algorithm for the matrix bandwidth minimization
cites work: A branch and bound algorithm for the maximum diversity problem
cites work: Experiments on the minimum linear arrangement problem
cites work: Antibandwidth and cyclic antibandwidth of meshes and hypercubes
cites work: Q4452897
cites work: Cutwidth of the de Bruijn graph
cites work: Cutwidth I: A linear time fixed parameter algorithm
cites work: A polynomial algorithm for the min-cut linear arrangement of trees
DBLP publication ID: journals/cor/MartiPDP13
DOI: 10.1016/J.COR.2012.05.016
description: scientific article; zbMATH DE number 6651722