Laying Out Sparse Graphs with Provably Minimum Bandwidth
From MaRDI portal
Publication:2890478
DOI10.1287/ijoc.1040.0083zbMath1239.90106OpenAlexW2049628958MaRDI QIDQ2890478
Alberto Caprara, Juan-José Salazar-González
Publication date: 8 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/e86c20a4f85f600c41c9da10ba969069e3db9c78
Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (8)
Optimization Bounds from the Branching Dual ⋮ A branch and bound algorithm for the matrix bandwidth minimization ⋮ A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs ⋮ Optimal linear arrangements using betweenness variables ⋮ Unnamed Item ⋮ A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices ⋮ A note on computational approaches for the antibandwidth problem ⋮ A compact quadratic model and linearizations for the minimum linear arrangement problem
Uses Software
This page was built for publication: Laying Out Sparse Graphs with Provably Minimum Bandwidth
