Scatter search for the cutwidth minimization problem
From MaRDI portal
Publication:1761768
DOI10.1007/s10479-011-0907-2zbMath1251.90374OpenAlexW2049825837WikidataQ57856227 ScholiaQ57856227MaRDI QIDQ1761768
Abraham Duarte, Rafael Martí, Juan José Pantrigo
Publication date: 15 November 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-0907-2
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Combining intensification and diversification strategies in VNS. An application to the vertex separation problem, Variable neighborhood search for the vertex separation problem, Scatter search for minimizing weighted tardiness in a single machine scheduling with setups, Multi-objective variable neighborhood search: an application to combinatorial optimization problems, Population-based iterated greedy algorithm for the S-labeling problem, A Generalization of the Directed Graph Layering Problem, Scatter search for the bandpass problem, Multistart search for the cyclic cutwidth minimization problem, Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On minimizing width in linear layouts
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- GRASP and path relinking for the max-min diversity problem
- A probabilistic heuristic for a computationally difficult set covering problem
- GRASP and path relinking for the matrix bandwidth minimization.
- Greedy randomized adaptive search procedures
- A hybrid heuristic for the \(p\)-median problem
- Scatter search. Methodology and implementation in C. With CD-ROM.
- A branch and bound algorithm for the matrix bandwidth minimization
- Topological Bandwidth
- A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
- Optimal Linear Ordering
