Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Fix the remainder group size in binary grouping solution of the multiple knapsack problem#1387

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to ourterms of service andprivacy statement. We’ll occasionally send you account related emails.

Already on GitHub?Sign in to your account

Merged
mhayter merged 1 commit intocp-algorithms:mainfromvirinci:patch-1
Nov 2, 2024

Conversation

virinci
Copy link
Contributor

The existing groups are:$2^0, 2^1, \dots, 2^{\lfloor \log_2(k+1) \rfloor - 1}$ and they sum up to$2^{\lfloor \log_2(k+1) \rfloor} - 1$. So, the remaining groups should be$k_i - sum$.

@mhayter
Copy link
Contributor

I think you're right! Good catch!

@mhaytermhayter merged commitefecea8 intocp-algorithms:mainNov 2, 2024
3 checks passed
github-actionsbot added a commit that referenced this pull requestNov 2, 2024
@virincivirinci deleted the patch-1 branchNovember 7, 2024 05:36
Sign up for freeto join this conversation on GitHub. Already have an account?Sign in to comment
Reviewers
No reviews
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.

2 participants
@virinci@mhayter

[8]ページ先頭

©2009-2025 Movatter.jp