-
Updated
Nov 6, 2020 - Java
constraint-programming
Here are 157 public repositories matching this topic...
-
Updated
Nov 3, 2020 - JavaScript
In the registry function for gecode_cumulatives the case where the tasks may have zero-length duration and the bound is not assigned is currently decomposed into basic constraints.
An alternative re-write strategy would be to rewrite to cumulatives using multiple machines, wher
-
Updated
Jan 7, 2020 - Prolog
-
Updated
Apr 6, 2020 - Prolog
-
Updated
Jun 25, 2020 - C#
-
Updated
Nov 3, 2020 - Haskell
-
Updated
Sep 6, 2019 - Python
It should be easier to configure the logging table. i.e setting the min_diff_duration.
-
Updated
Sep 18, 2020 - C++
-
Updated
Nov 7, 2020 - Scala
-
Updated
Aug 3, 2020 - Kotlin
-
Updated
Oct 29, 2020 - Python
-
Updated
Nov 8, 2020 - C++
-
Updated
Feb 9, 2020 - Prolog
-
Updated
May 9, 2018 - Haskell
-
Updated
Jan 27, 2020 - Scala
-
Updated
Sep 30, 2020 - JavaScript
-
Updated
Nov 1, 2020 - C++
-
Updated
Sep 25, 2020 - Elixir
-
Updated
Jul 19, 2019 - C++
-
Updated
Dec 2, 2017 - Scala
-
Updated
Jan 21, 2019 - Java
-
Updated
Oct 13, 2020 - Java
-
Updated
May 31, 2016 - JavaScript
-
Updated
Aug 13, 2019 - Python
-
Updated
Aug 3, 2017 - F#
-
Updated
Oct 20, 2020 - Jupyter Notebook
Improve this page
Add a description, image, and links to the constraint-programming topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the constraint-programming topic, visit your repo's landing page and select "manage topics."
Expected behavior
limit the first search strategy to 1 second in solve THEN use the second strategy (to improve the best so far solution)
Actual behavior
search.limit Monitor are attach to search and not strategy.
Minimal Working Example
Experienced with choco-solver-4.0.4
solv.setSearch(
new AbstractStrategy[] {
Search.intVarSearch(new MaxRegret(), new IntDoma