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

DOI10.1007/S10878-011-9406-2MaRDI QIDQ1928510zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

branch-and-bound algorithmcutwidthgraphminimum cut linear arrangementtabu search

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• On minimum cuts and the linear arrangement problem
• A variation on the min cut linear arrangement problem
• A branch-and-bound algorithm for solving max-\(k\)-cut problem
• Branch and bound for the cutwidth minimization problem
• A branch-and-price-and-cut algorithm for the pattern minimization problem
• An efficient algorithm for the minimum capacity cut problem
• A new approach to the minimum cut problem
• A branch-and-cut algorithm for the equicut problem
• A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
• A polynomial algorithm for the min-cut linear arrangement of trees

Cites work

• A branch-and-cut algorithm for the equicut problem
• A polynomial algorithm for the min-cut linear arrangement of trees
• An edge-isoperimetric problem for powers of the Petersen graph
• Crossing Numbers and Cutwidths
• Cutwidth I: A linear time fixed parameter algorithm
• Cutwidth II: Algorithms for partial w-trees of bounded degree
• Glauber dynamics on trees and hyperbolic graphs
• Graph-Theoretic Concepts in Computer Science
• scientific article; zbMATH DE number 3813518 (Why is no real title available?)
• Iterated tabu search for the maximum diversity problem
• Iterated tabu search for the unconstrained binary quadratic optimization problem
• LINEAR LAYOUT OF GENERALIZED HYPERCUBES
• Min Cut is NP-complete for edge weighted trees
• On the dynamics of the glass transition on Bethe lattices
• Optimal Assignments of Numbers to Vertices
• Solving Graph Bisection Problems with Semidefinite Programming
• Tabu Search—Part I

Cited in

(11)

• A branch-and-cut algorithm for the equicut problem
• On minimum cuts and the linear arrangement problem
• Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
• A branch-and-bound algorithm for solving max-\(k\)-cut problem
• Branch and bound for the cutwidth minimization problem
• A variation on the min cut linear arrangement problem
• scientific article; zbMATH DE number 4068611 (Why is no real title available?)
• A branch and bound algorithm for the minimum storage-time sequencing problem
• On a binary distance model for the minimum linear arrangement problem
• New lower bounds on the cutwidth of graphs
• A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants

This page was built for publication: A branch-and-bound algorithm for the minimum cut linear arrangement problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928510)