Efficient iterated greedy for the two-dimensional bandwidth minimization problem
From MaRDI portal
Publication:6106765
DOI10.1016/j.ejor.2022.09.004MaRDI QIDQ6106765
Eduardo G. Pardo, Sergio Cavero, Abraham Duarte
Publication date: 3 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Branch and bound for the cutwidth minimization problem
- Two models of two-dimensional bandwidth problems
- A framework for solving VLSI graph layout problems
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- The NP-completeness of the bandwidth minimization problem
- Finding exact solutions to the bandwidth minimization problem
- Variable neighborhood search: basics and variants
- GRASP and VNS for solving the \(p\)-next center problem
- An iterated greedy heuristic for a market segmentation problem with multiple attributes
- Greedy randomized adaptive search procedures
- Optimal labelling of unit interval graphs
- Multistart search for the cyclic cutwidth minimization problem
- A general variable neighborhood search for the cyclic antibandwidth problem
- Variable neighbourhood search for bandwidth reduction
- An improved simulated annealing algorithm for bandwidth minimization
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
- First vs. best improvement: an empirical study
- Square-root rule of two-dimensional bandwidth problem
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- Tabu search based heuristics for multi-floor facility layout
- Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
This page was built for publication: Efficient iterated greedy for the two-dimensional bandwidth minimization problem
