Skip to content
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.

Sign up for GitHub

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

Already on GitHub? Sign in to your account

Jump to bottom

Change the approach used from a divide-and-conquer algorithm to a linear programming solver. #1

Open
pieterjansevanrensburg opened this issue Mar 6, 2021 · 0 comments
Open

Change the approach used from a divide-and-conquer algorithm to a linear programming solver. #1

pieterjansevanrensburg opened this issue Mar 6, 2021 · 0 comments
Assignees
@pieterjansevanrensburg
Labels
enhancement New feature or request
Milestone
Release Ready

Comments

@pieterjansevanrensburg
Copy link
Owner

The divide-and-conquer algorithm only produces an approximate solution. Whereas, a linear programming solver will result in an exact/almost exact solution. In light of this, the program should switch to using pulp to find the solution.
@pieterjansevanrensburg pieterjansevanrensburg self-assigned this Mar 6, 2021
@pieterjansevanrensburg pieterjansevanrensburg added the enhancement New feature or request label Mar 6, 2021
@pieterjansevanrensburg pieterjansevanrensburg added this to the Release Ready milestone Mar 8, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@pieterjansevanrensburg pieterjansevanrensburg

Labels
enhancement New feature or request
Projects
None yet
Milestone
Release Ready
Development

No branches or pull requests
1 participant
@pieterjansevanrensburg