1. 26 Nov, 2019 2 commits
  2. 25 Nov, 2019 1 commit
  3. 21 Nov, 2019 1 commit
  4. 14 Nov, 2019 1 commit
    • Gauthier Quesnel's avatar
      travis: fix missing constructor error for both gcc 7,8 · ddf30d08
      Gauthier Quesnel authored
      Error seems to unrecognize the ``[[maybe_unused]]` token with the `if
      constexpr`:
      
      error: expected unqualified-id before ‘[’ token
      
           debug_logger([[maybe_unused]] const std::string_view name) noexcept
      
      lib/src/itm-common.hpp:1796:18: error: expected ‘)’ before ‘[’ token
      
           debug_logger([[maybe_unused]] const std::string_view name) noexcept
      
                       ~^
      ddf30d08
  5. 12 Nov, 2019 1 commit
  6. 08 Nov, 2019 2 commits
  7. 22 Oct, 2019 2 commits
  8. 21 Oct, 2019 1 commit
  9. 15 Oct, 2019 1 commit
    • Gauthier Quesnel's avatar
      core: replace init-random with init-random and init-policy-random · 6d561f73
      Gauthier Quesnel authored
      The value of each variables in the solution/initial vector is
      initialized according to the init-policy-random parameter of the
      bernouilli's law:
      
      - 1 use the init-policy algorithm to affect 0 or 1.
      - 0 use the toss up algorithm (init-random parameter and the
        bernouilli's law) to affect 0 or 1.
      6d561f73
  10. 14 Oct, 2019 2 commits
  11. 11 Oct, 2019 3 commits
  12. 13 Aug, 2019 1 commit
    • Gauthier Quesnel's avatar
      core: replace old init-policy with pessimistic/optimistic initializer · d0e254aa
      Gauthier Quesnel authored
      Change the initialization and reinitialization policy of the solution
      vector. Values are:
      
      * `bastert`: for each variable (or at `init-random` rate) use cost values to set
        or unset variable.
      * `pessimistic-solve`: found a solution for each (or at `init-random` rate)
        constraints. For soft constraints, affect one to strict minimum variables.
      * `optimistic-solve`: found a solution for each (or or `init-random` rate)
        constraints. For soft constraints, affect one to the maximum variables that
        valid the constraint.
      * `cycle` (default): Only for the optimization mode, start with the
        `pessimistic-solve` mode and change to `bastert` then `pessimistic-solve`
        mode. The change between mode is done if and only if three times, optimization
        fails to improve the current solution.
      d0e254aa
  13. 25 Jul, 2019 4 commits
  14. 20 Jun, 2019 1 commit
  15. 17 Jun, 2019 1 commit
  16. 15 Jun, 2019 2 commits
  17. 12 Jun, 2019 3 commits
  18. 13 Mar, 2019 1 commit
  19. 12 Feb, 2019 2 commits
  20. 06 Feb, 2019 1 commit
  21. 31 Jan, 2019 7 commits