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

Improved Search Procedures #79

Open
ccoffrin opened this issue Dec 14, 2017 · 1 comment
Open

Improved Search Procedures #79

ccoffrin opened this issue Dec 14, 2017 · 1 comment
Labels
enhancement

Comments

@ccoffrin
Copy link
Member

Implement some of form of LDS. A natural first choice would be to use the Pseudo Cost values for defined the branching order.
@ccoffrin
Copy link
Member Author

ccoffrin commented Jun 28, 2018 •
edited
Loading

A natural choice is to use a feasible solution to guide the LDS. You might also consider using the Activity metric for variable ordering instead of PseudoCost.

One can also consider DFS with a failure limit, which results in an LNS-like search.

@ccoffrin ccoffrin changed the title Least Discrepancy Search Improved Search Procedures Jun 28, 2018
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@ccoffrin