Examples of solver.Solver

solver.Solver
The Solver is the header component of Constraint Programming. It embeds the list of Variable (and their Domain), the Constraint's network, and a IPropagationEngine to pilot the propagation.
Solver includes a AbstractSearchLoop to guide the search loop: apply decisions and propagate, run backups and rollbacks and store solutions. @author Xavier Lorca @author Charles Prud'homme @version 0.01, june 2010 @see solver.variables.Variable @see solver.constraints.Constraint @since 0.01

        LoggerFactory.getLogger("bench").info(st.toString());
    }


    @Override
    public void createSolver() {
        solver = new Solver("CycloHexan");
    }

View Full Code Here

        this.horizon = n - 1;
    }


    @Override
    public void createSolver() {
        solver = new Solver("Pert");
    }

View Full Code Here

    LoggerFactory.getLogger("bench").info(st.toString());
  }


  @Override
  public void createSolver() {
    solver = new Solver("HybridCycloHexan");
  }

View Full Code Here


    Constraint[] heavy = new Constraint[3];


    @Override
    public void createSolver() {
        solver = new Solver("Partition " + N);
    }

View Full Code Here


    IntVar[] letters;


    @Override
    public void createSolver() {
        solver = new Solver("Alpha");
    }

View Full Code Here


    IntVar[] vars;


    @Override
    public void createSolver() {
        solver = new Solver("AbsoluteEvaluation");
    }

View Full Code Here

    BoolVar[] viols;
    IntVar violations;


    @Override
    public void createSolver() {
        solver = new Solver("Photo");
    }

View Full Code Here

    IntVar objective;




    @Override
    public void createSolver() {
        solver = new Solver("Air plane landing");
    }

View Full Code Here

     */
    public static Constraint mod(IntVar X, IntVar Y, IntVar Z) {
        int xl = Math.abs(X.getLB());
        int xu = Math.abs(X.getUB());
        int b = Math.max(xl, xu);
        Solver solver = X.getSolver();
        IntVar t1 = VariableFactory.bounded(StringUtils.randomName(), -b, b, solver);
        IntVar t2 = VariableFactory.bounded(StringUtils.randomName(), -b, b, solver);
        Constraint div = IntConstraintFactory.eucl_div(X, Y, t1);
        Constraint tim = IntConstraintFactory.times(t1, Y, t2);
        Constraint sum = IntConstraintFactory.sum(new IntVar[]{Z, t2}, X);

View Full Code Here

     * @return
     */
    public static Constraint[] bin_packing(IntVar[] ITEM_BIN, int[] ITEM_SIZE, IntVar[] BIN_LOAD, int OFFSET) {
        int nbBins = BIN_LOAD.length;
        int nbItems = ITEM_BIN.length;
        Solver s = ITEM_BIN[0].getSolver();
        BoolVar[][] xbi = VF.boolMatrix("xbi", nbBins, nbItems, s);
        int sum = 0;
        for (int is : ITEM_SIZE) {
            sum += is;
        }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of solver.Solver

choco.AllDifferentTest

choco.checker.consistency.ConsistencyChecker

choco.checker.correctness.CorrectnessChecker

choco.checker.fmk.Correctness

choco.ClauseTest

choco.explanations.ExplanationTest

choco.IntLinCombTest

choco.LimitsTest

choco.LogicTreeTest

choco.NotEqualX_YCTest

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.