Skip to content

Ardalan-Sia/BFD-algorithm-for-Bin-Packing-Problem

View on GitHub ↗Related repositories →

The Best Fit Decreasing (BFD) algorithm is a popular heuristic for solving the bin packing problem. The bin packing problem involves packing objects of various sizes into a finite number of bins in a way that minimizes the number of bins used.

active 2024-07-04 → 2024-07-07 (UTC)

Complete coverage27,507 / 27,507 hourly files (100%) · 2 absent upstream2023-08-15 → 2026-10-04 (UTC)
Events
6
Pushes
4
Pull requests
0
Issues
0
Stars
0
Forks
0

Activity over time

Daily event counts in the loaded window

Line chart, 4 days from 2024-07-04 to 2024-07-07. Pushes: 4 total, peak 3 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 0 total, peak 0 in a day.

  • Pushes
  • Pull requests
  • Issues
  • Comments
  • Stars

Top contributors

Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity

ContributorContributionsPushesPRsComments
Ardalan-Sia4400

Recent activity

Latest issues, pull requests and releases

No issue or PR events — this repo's activity is pushes only.

Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 0 stars here means stars gained during the window, not the repo's star count.