Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
From MaRDI portal
Publication:2029285
Recommendations
- A variable neighbourhood search approach to the cutwidth minimization problem
- Branch and bound for the cutwidth minimization problem
- Scatter search for the cutwidth minimization problem
- Multistart search for the cyclic cutwidth minimization problem
- A branch-and-bound algorithm for the minimum cut linear arrangement problem
Cites work
- A branch and bound algorithm for the matrix bandwidth minimization
- A branch-and-bound algorithm for the minimum cut linear arrangement problem
- A hybrid method for the probabilistic maximal covering location-allocation problem
- A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
- A polynomial algorithm for the min-cut linear arrangement of trees
- An analysis of variance test for normality (complete samples)
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- Approximating layout problems on random geometric graphs
- Branch and bound for the cutwidth minimization problem
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
- Complexity Results for Bandwidth Minimization
- Cutwidth of the de Bruijn graph
- Cutwidth: obstructions and algorithmic aspects
- GRASP and path relinking for the matrix bandwidth minimization.
- GRASP and path relinking for the max-min diversity problem
- scientific article; zbMATH DE number 2080246 (Why is no real title available?)
- scientific article; zbMATH DE number 1875430 (Why is no real title available?)
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
- Min Cut is NP-complete for edge weighted trees
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Narrowness, pathwidth, and their application in natural language processing
- On minimizing width in linear layouts
- On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
- One-dimensional logic gate assignment and interval graphs
- Parallel variable neighbourhood search strategies for the cutwidth minimization problem
- PATHWIDTH AND LAYERED DRAWINGS OF TREES
- Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
- Scatter search for the cutwidth minimization problem
- Some simplified NP-complete graph problems
- Topological Bandwidth
- Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees
- Variable neighborhood search for the vertex separation problem
Cited in
(8)- Scatter search for the cutwidth minimization problem
- Multistart search for the cyclic cutwidth minimization problem
- Polynomial time efficient construction heuristics for vertex separation minimization problem
- A survey of adaptive large neighborhood search algorithms and applications
- A variable neighbourhood search approach to the cutwidth minimization problem
- Branch and bound for the cutwidth minimization problem
- Strong SDP based bounds on the cutwidth of a graph
- Mathematical formulation and heuristic methods for the min-max sitting arrangement problem in the cycle
This page was built for publication: Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2029285)
