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.

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

Solving the Minimum Spanning Tree Problem #1

Open
3 tasks
1ozturkbe opened this issue Feb 15, 2018 · 0 comments
Open
3 tasks

Solving the Minimum Spanning Tree Problem #1

1ozturkbe opened this issue Feb 15, 2018 · 0 comments

Comments

@1ozturkbe
Copy link
Contributor

1ozturkbe commented Feb 15, 2018

To keep track of what has been tried.
Approaches:

  • Alternative objective functions: sums and products of connectivity and flows
  • Sequential GP, pruning edges with no connectivity through substitutions.
  • Dynamic GP? (Need to flesh this idea out.)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant