Branch and bound for the cutwidth minimization problem
DOI10.1016/J.COR.2012.05.016zbMATH Open1349.90820DBLPjournals/cor/MartiPDP13OpenAlexW2160467939WikidataQ57856091 ScholiaQ57856091MaRDI QIDQ339558FDOQ339558
Abraham Duarte, Rafael Martí, Eduardo G. Pardo, Juan J. Pantrigo
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.05.016
Recommendations
- A branch-and-bound algorithm for the minimum cut linear arrangement problem
- A variable neighbourhood search approach to the cutwidth minimization problem
- Scatter search for the cutwidth minimization problem
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
- Multistart search for the cyclic cutwidth minimization problem
Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Integer programming (90C10) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some simplified NP-complete graph problems
- Title not available (Why is that?)
- Optimal numberings and isoperimetric problems on graphs
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- A probabilistic heuristic for a computationally difficult set covering problem
- An annotated bibliography of GRASP-Part II: Applications
- An annotated bibliography of GRASP – Part I: Algorithms
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- Optimal linear labelings and eigenvalues of graphs
- A branch and bound algorithm for the maximum diversity problem
- A branch and bound algorithm for the matrix bandwidth minimization
- Decorous lower bounds for minimum linear arrangement
- Topological Bandwidth
- A polynomial algorithm for the min-cut linear arrangement of trees
- A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
- Cutwidth of the de Bruijn graph
- Optimal Linear Ordering
- Cutwidth I: A linear time fixed parameter algorithm
- Experiments on the minimum linear arrangement problem
- On minimizing width in linear layouts
Cited In (10)
- Lower bounds for the bandwidth problem
- Multistart search for the cyclic cutwidth minimization problem
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
- Strong SDP based bounds on the cutwidth of a graph
- Computing tight bounds via piecewise linear functions through the example of circle cutting problems
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
- A note on computational approaches for the antibandwidth problem
- A branch-and-bound algorithm for the minimum cut linear arrangement problem
- Efficient iterated greedy for the two-dimensional bandwidth minimization problem
- Theoretical lower bound for border length minimization problem
Uses Software
This page was built for publication: Branch and bound for the cutwidth minimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339558)
