(Incremental) priority algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On the Power of Priority Algorithms for Facility Location and Set Cover
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Eighteenth national conference on Artificial intelligence
Exhaustive approaches to 2D rectangular perfect packings
Information Processing Letters
New heuristic and interactive approaches to 2D rectangular strip packing
Journal of Experimental Algorithmics (JEA)
Heuristic-biased stochastic sampling
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Semi-greedy heuristics: An empirical study
Operations Research Letters
Collaboration Between Hyperheuristics to Solve Strip-Packing Problems
IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
An evolutionary hyperheuristic to solve strip-packing problems
IDEAL'07 Proceedings of the 8th international conference on Intelligent data engineering and automated learning
Randomized priority algorithms
Theoretical Computer Science
An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
Operations Research
Hi-index | 0.89 |
We introduce BubbleSearch, a general approach for extending priority-based greedy heuristics. Following the framework recently developed by Borodin et al., we consider priority algorithms, which sequentially assign values to elements in some fixed or adaptively determined order. BubbleSearch extends priority algorithms by selectively considering additional orders near an initial good ordering. While many notions of nearness are possible, we explore algorithms based on the Kendall-tau distance (also known as the BubbleSort distance) between permutations. Our contribution is to elucidate the BubbleSearch paradigm and experimentally demonstrate its effectiveness.