WikiRNG
Rolled Roll your own

Fernandez's bound

In computer science and operations research, Fernandez’s bound (FB) is a lower-bounding technique used in exact algorithms for multiprocessor scheduling problems, particularly within branch-and-bound frameworks. It provides tighter lower bounds than some earlier methods (e.g., Hu's bound).

Read it on Wikipedia · Version rolled

RemarkableTop 5.7%
230,172SP

Badges16 earned

  1. Too TechnicalRemarkable+210,372 SP
    Tagged as too technical.
  1. Multiple IssuesNotable+5,495 SP
    Has the multiple issues box.
  2. ApostropheNotable+3,117 SP
    Title has an apostrophe.
  3. Further ReadingNotable+2,500 SP
    Has a Further reading section.
  4. LonelyNotable+1,370 SP
    Only one article links here.
  5. More Citations NeededNotable+1,331 SP
    Tagged as needing more sources.
  6. Citation MaintenanceNotable+1,263 SP
    Has a citation flagged for maintenance.
Basic9
rolled by CraneGenesis4k
CraneGenesis4k rolled Fernandez's bound | WikiRNG