[PDF][PDF] Graph and set variables implementation in OscaR
A Lambert - 2014 - Citeseer
… class CPSetVar.scala from the CP package of OscaR and at all the constraints defined over
set variables in the CP package. The source code is available on the Bitbucket repository [5]. …
set variables in the CP package. The source code is available on the Bitbucket repository [5]. …
Cardinality reasoning for bin-packing constraint: Application to a tank allocation problem
… c Springer-Verlag Berlin Heidelberg 2012 … The Scala model of the problem implemented in
OscaR [4] is given in Listing 1.1. In this model, two sets of variables … Scala/OscaR CP Model …
OscaR [4] is given in Listing 1.1. In this model, two sets of variables … Scala/OscaR CP Model …
Testing Global Constraints
A Massart, V Rombouts, P Schaus - arXiv preprint arXiv:1807.03975, 2018 - arxiv.org
… of usage of CPChecker with both Scala solver and Java solvers, namely OscaR[2], Choco[1] …
filtering of the Global Cardinality constraint of OscaR was not arc consistent for all the …
filtering of the Global Cardinality constraint of OscaR was not arc consistent for all the …
Multi-objective large neighborhood search
… We introduce modeling abstractions into the OscaR solver for MO-LNS … Scala source-code
of our implementation as well as some complete MO-LNS examples are available on OscaR …
of our implementation as well as some complete MO-LNS examples are available on OscaR …
[PDF][PDF] Combining Neighborhoods into Search Strategies
R De Landtsheer, Y Guyot, C Ponsard - researchgate.net
… The OscaR.cbls solver incorporates roughly thirty combinators. Oscar is written in Scala, and
… Oscar.cbls : an open source framework for constraint-based local search. In Proc. ORBEL'27…
… Oscar.cbls : an open source framework for constraint-based local search. In Proc. ORBEL'27…
[PDF][PDF] Towards the Complexity of Differentiation Through Lazy Updates in Local Search Engines
RDLY Guyot, GOC Ponsard - Scientific committee - orbel.be
… We will apply laziness on invariants of OscaR. cbls featuring O (log ( n )) complexity or higher:
ArgMax, ArgMin, etc. We will also try to extend the laziness to moves impacting the output …
ArgMax, ArgMin, etc. We will also try to extend the laziness to moves impacting the output …
Compact-table: efficiently filtering table constraints with reversible sparse bit-sets
J Demeulenaere, R Hartert, C Lecoutre… - Principles and Practice …, 2016 - Springer
… implemented in or-tools, with a bit-set representation of tables, dates back to 2012, whereas
the version of CT presented in this paper is exactly the last one implemented in OscaR [29]. …
the version of CT presented in this paper is exactly the last one implemented in OscaR [29]. …
Conflict ordering search for scheduling problems
We introduce a new generic scheme to guide backtrack search, called Conflict Ordering
Search (COS), that reorders variables on the basis of conflicts that happen during search. …
Search (COS), that reorders variables on the basis of conflicts that happen during search. …