A branch-and-bound algorithm for the minimum cut linear arrangement problem-Reference-Cited by-同舟云学术

A branch-and-bound algorithm for the minimum cut linear arrangement problem

Published:2011-06-18 Issue:4 Volume:24 Page:540-563
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Palubeckis Gintaras,Rubliauskas Dalius

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-011-9406-2.pdf

Reference31 articles.

1. Berger N, Kenyon C, Mossel E, Peres Y (2005) Glauber dynamics on trees and hyperbolic graphs. Probab Theory Relat Fields 131:311–340

2. Bezrukov SL, Das SK, Elsässer R (2000) An edge-isoperimetric problem for powers of the Petersen graph. Ann Comb 4:153–169

3. LNCS;G Blin,2005

4. Brunetta L, Conforti M, Rinaldi G (1997) A branch-and-cut algorithm for the equicut problem. Math Program 78:243–263

5. Díaz J, Petit J, Serna M (2002) A survey of graph layout problems. ACM Comput Surv 34:313–356

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Linear Layout Problems;Handbook of Heuristics;2018

2. Linear Layout Problems;Handbook of Heuristics;2016

3. An Iterated Tabu Search Approach for the Clique Partitioning Problem;The Scientific World Journal;2014

4. Parallel variable neighbourhood search strategies for the cutwidth minimization problem;IMA Journal of Management Mathematics;2013-12-11

5. A New Branch and Bound Algorithm for the Cyclic Bandwidth Problem;Advances in Computational Intelligence;2013