A branch-and-bound algorithm for the minimum cut linear arrangement problem
From MaRDI portal
Publication:1928510
DOI10.1007/s10878-011-9406-2zbMath1261.90048OpenAlexW2053834570MaRDI QIDQ1928510
Dalius Rubliauskas, Gintaras Palubeckis
Publication date: 3 January 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-011-9406-2
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Min Cut is NP-complete for edge weighted trees
- A branch-and-cut algorithm for the equicut problem
- An edge-isoperimetric problem for powers of the Petersen graph
- Glauber dynamics on trees and hyperbolic graphs
- Iterated tabu search for the maximum diversity problem
- On the dynamics of the glass transition on Bethe lattices
- A polynomial algorithm for the min-cut linear arrangement of trees
- Tabu Search—Part I
- Solving Graph Bisection Problems with Semidefinite Programming
- Crossing Numbers and Cutwidths
- Cutwidth I: A linear time fixed parameter algorithm
- Cutwidth II: Algorithms for partial w-trees of bounded degree
- Optimal Assignments of Numbers to Vertices
- LINEAR LAYOUT OF GENERALIZED HYPERCUBES
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: A branch-and-bound algorithm for the minimum cut linear arrangement problem