- 03 Feb, 2020 1 commit
-
-
Gauthier Quesnel authored
-
- 30 Jan, 2020 1 commit
-
-
Gauthier Quesnel authored
-
- 07 Jan, 2020 2 commits
-
-
Gauthier Quesnel authored
-
Gauthier Quesnel authored
-
- 04 Jan, 2020 1 commit
-
-
Gauthier Quesnel authored
-
- 28 Dec, 2019 1 commit
-
-
Gauthier Quesnel authored
-
- 26 Dec, 2019 1 commit
-
-
Gauthier Quesnel authored
-
- 25 Dec, 2019 2 commits
-
-
Gauthier Quesnel authored
-
Gauthier Quesnel authored
-
- 02 Dec, 2019 1 commit
-
-
Gauthier Quesnel authored
-
- 28 Nov, 2019 1 commit
-
-
Gauthier Quesnel authored
-
- 25 Nov, 2019 1 commit
-
-
Gauthier Quesnel authored
-
- 12 Nov, 2019 1 commit
-
-
Gauthier Quesnel authored
-
- 22 Oct, 2019 2 commits
-
-
Gauthier Quesnel authored
The new `cycle` option allows to cycle between every constaint order option from `none` to `pi-sign-change`.
-
Gauthier Quesnel authored
w is now a real and follows the rules: - [0..1]: defines a percentage of limit loop where the kappa is not used. For example -p w:0.5 -p limit:100 gives 50 loop without kappa computation and 50 with kappa computation. - > 1: defines a static number of loop without kappa computation. For examples -p w:50 -p limit:-1 gives 50 loop without kappa and +oo with kappa computation.
-
- 15 Oct, 2019 1 commit
-
-
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.
-
- 11 Oct, 2019 1 commit
-
-
Gauthier Quesnel authored
-
- 06 Sep, 2019 1 commit
-
-
Gauthier Quesnel authored
-
- 19 Aug, 2019 1 commit
-
-
Gauthier Quesnel authored
-
- 13 Aug, 2019 1 commit
-
-
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.
-
- 25 Jul, 2019 1 commit
-
-
Gauthier Quesnel authored
-
- 20 Jun, 2019 1 commit
-
-
Gauthier Quesnel authored
-
- 12 Jun, 2019 1 commit
-
-
Gauthier Quesnel authored
-
- 14 Mar, 2019 1 commit
-
-
Gauthier Quesnel authored
-
- 13 Mar, 2019 1 commit
-
-
Gauthier Quesnel authored
-
- 27 Feb, 2019 1 commit
-
-
Gauthier Quesnel authored
-
- 22 Feb, 2019 1 commit
-
-
Gauthier Quesnel authored
-
- 06 Feb, 2019 1 commit
-
-
Gauthier Quesnel authored
-
- 27 Jan, 2019 1 commit
-
-
Gauthier Quesnel authored
The VERSION_TWEAK is removed from version name. It's useless for this little project.
-
- 24 Jan, 2019 1 commit
-
-
Gauthier Quesnel authored
To improve the use in command line interface, graphical user interface or R, we replace, only for computation output (ex.: remaining constraint message, new solution found, etc.), the output message stream using private functions debug(ctx, ...), info(ctx, ...), warning(ctx, ...) interface with callback mechanism in the baryonyx::context class. (Closes: #28)
-
- 16 Jan, 2019 1 commit
-
-
Gauthier Quesnel authored
Replace specific Linux/Unix source code about color in (pseudo)terminal with the fmt::text_style and fmt::terminal_color enumeration.
-
- 15 Jan, 2019 1 commit
-
-
Gauthier Quesnel authored
-
- 14 Jan, 2019 2 commits
-
-
Gauthier Quesnel authored
-
Gauthier Quesnel authored
-
- 08 Jan, 2019 1 commit
-
-
Gauthier Quesnel authored
-
- 10 Dec, 2018 1 commit
-
-
Gauthier Quesnel authored
-
- 16 Nov, 2018 2 commits
-
-
Gauthier Quesnel authored
Reported on MacOS.
-
Gauthier Quesnel authored
Baryonyx permits to run benchmark on a set of problems described in a csv files. This option is available using the --bench [name] option and csv files. All Baryonyx parameters are available to perform the benchmark. For example: baryonyx --bench bx-0.3 -pdelta:0.01 -ptime-limit:60 spp.csv The benchmark mode generates a new spp-new.csv file with results of computation. The csv format is: file optimum status cplex lsp bx-0.2 (1) cplex: lsp: (2) bx-0.2: scp410 optimum 514 514 514 804 (3) scp41 optimum 429 429 429 627 scp42 optimum 512 512 512 934 (1) The header: three columns mandatory (file, optimum, status) and one solver per column. In this example, cplex, local solver and baryonyx 0.2. (2) The description part: one line per solver to describe version and parameter for example. (3) Finally, one line per solve: model name (with or without extension), status (optimum/feasible), best solution found and solver’s solution. inf can be use to indicate no solution found. In benchmark directory, some files are provided and a script to download classical problem.
-
- 12 Nov, 2018 1 commit
-
-
Gauthier Quesnel authored
Without this option, we can not choose pnm or file observation.
-
- 10 Nov, 2018 1 commit
-
-
Gauthier Quesnel authored
-