-
Updated
Nov 6, 2020 - Java
constraint-solver
Here are 62 public repositories matching this topic...
-
Updated
May 22, 2019 - JavaScript
-
Updated
Sep 16, 2017 - Swift
-
Updated
Apr 11, 2020 - Haskell
-
Updated
Oct 24, 2019 - Rust
-
Updated
Sep 5, 2019 - C++
-
Updated
Sep 11, 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
Nov 5, 2020 - TypeScript
-
Updated
Feb 19, 2019 - Swift
-
Updated
Mar 5, 2019 - Swift
-
Updated
Jun 25, 2020 - C#
It should be easier to configure the logging table. i.e setting the min_diff_duration
.
-
Updated
Jan 10, 2017 - PHP
-
Updated
Jun 2, 2020 - Swift
-
Updated
Oct 28, 2020 - Scala
-
Updated
Nov 13, 2018 - Haxe
-
Updated
Oct 7, 2019 - OCaml
-
Updated
Sep 16, 2020 - Rust
-
Updated
Jul 16, 2020 - Python
-
Updated
Oct 14, 2020 - Java
-
Updated
Apr 15, 2019 - Java
-
Updated
Aug 23, 2018 - C#
-
Updated
Nov 21, 2018 - Java
-
Updated
Jun 26, 2019 - Haxe
-
Updated
Sep 4, 2020 - PHP
Improve this page
Add a description, image, and links to the constraint-solver topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the constraint-solver 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