Efficient iterated greedy for the two-dimensional bandwidth minimization problem

DOI10.1016/J.EJOR.2022.09.004MaRDI QIDQ6106765zbMATH OpenFDO

Authors Sergio Cavero, Eduardo G. Pardo, Abraham Duarte

Publication date 3 July 2023

Published in European Journal of Operational Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/J.EJOR.2022.09.004

zbMATH Keywords

bandwidthcombinatorial optimizationgraph layout problemheuristicsiterated greedy

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• scientific article; zbMATH DE number 2079803
• Laying out sparse graphs with provably minimum bandwidth
• A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs
• Exact and heuristic solutions to the bandwidth minimization problem
• An improved simulated annealing algorithm for bandwidth minimization

Cites work

• A framework for solving VLSI graph layout problems
• A general variable neighborhood search for the cyclic antibandwidth problem
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
• An improved simulated annealing algorithm for bandwidth minimization
• An iterated greedy heuristic for a market segmentation problem with multiple attributes
• Branch and bound for the cutwidth minimization problem
• Finding exact solutions to the bandwidth minimization problem
• First vs. best improvement: an empirical study
• GRASP and VNS for solving the \(p\)-next center problem
• Greedy randomized adaptive search procedures
• scientific article; zbMATH DE number 4070955 (Why is no real title available?)
• scientific article; zbMATH DE number 719423 (Why is no real title available?)
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
• Multistart search for the cyclic cutwidth minimization problem
• Optimal labelling of unit interval graphs
• Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
• Square-root rule of two-dimensional bandwidth problem
• Tabu search based heuristics for multi-floor facility layout
• The NP-completeness of the bandwidth minimization problem
• Two models of two-dimensional bandwidth problems
• Variable neighborhood search: basics and variants
• Variable neighbourhood search for bandwidth reduction

Cited in

(2)

• Mathematical formulation and heuristic methods for the min-max sitting arrangement problem in the cycle
• A double-stage heuristic algorithm for the antibandwidth maximization problem via the linear bottleneck assignment optimization

This page was built for publication: Efficient iterated greedy for the two-dimensional bandwidth minimization problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6106765)