Bubblesearch: a simple heuristic for improving priority-based greedy algorithms (Q1045924): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2005.08.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2142044446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Packings in Two Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved BL lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge crossings in drawings of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-greedy heuristics: An empirical study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Human-guided search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exhaustive approaches to 2D rectangular perfect packings / rank
 
Normal rank
Property / cites work
 
Property / cites work: New heuristic and interactive approaches to 2D rectangular strip packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452897 / rank
 
Normal rank

Latest revision as of 08:18, 2 July 2024

scientific article
Language Label Description Also known as
English
Bubblesearch: a simple heuristic for improving priority-based greedy algorithms
scientific article

    Statements

    Bubblesearch: a simple heuristic for improving priority-based greedy algorithms (English)
    0 references
    18 December 2009
    0 references
    0 references
    greedy algorithms
    0 references
    priority algorithms
    0 references
    randomized algorithms
    0 references
    heuristic algorithms
    0 references
    GRASP algorithms
    0 references
    0 references
    0 references
    0 references