Exact and heuristic solutions to the bandwidth minimization problem
From MaRDI portal
Applications of graph theory (05C90) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
Cited in
(12)- A branch and bound algorithm for the matrix bandwidth minimization
- An improved simulated annealing algorithm for bandwidth minimization
- Lower bounds for the bandwidth problem
- Laying out sparse graphs with provably minimum bandwidth
- On the Probable Performance of Heuristics for Bandwidth Minimization
- scientific article; zbMATH DE number 2079803 (Why is no real title available?)
- scientific article; zbMATH DE number 1778090 (Why is no real title available?)
- Level-based heuristics and hill climbing for the antibandwidth maximization problem
- Optimization Bounds from the Branching Dual
- A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs
- Parallel computation for the bandwidth minimization problem
- Efficient iterated greedy for the two-dimensional bandwidth minimization problem
This page was built for publication: Exact and heuristic solutions to the bandwidth minimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3098245)
