Package solver

Examples of solver.Solver.post()

164
165
166
167
168
169
170
171
172
173
174
        IntVar sum = VariableFactory.bounded("scal", -99999999, 99999999, solver);
        Constraint[] cstrs = new Constraint[]{
                IntConstraintFactory.scalar(bins, coeffs, sum),
                IntConstraintFactory.arithm(sum, opname, b)
        };
        solver.post(cstrs);
        solver.set(IntStrategyFactory.lexico_LB(bins));
        return solver;
    }

    @Test(groups = "1m")
View Full Code Here
56
57
58
59
60
61
62
63
64
65
66
        for (int i = 0; i < n - 1; i++) {
            for (int j = i + 1; j < n; j++) {
                int k = j - i;
                Constraint neq = IntConstraintFactory.arithm(vars[i], "!=", vars[j]);
                solver.post(neq);
                solver.post(IntConstraintFactory.arithm(vars[i], "!=", vars[j], "+", -k));
                solver.post(IntConstraintFactory.arithm(vars[i], "!=", vars[j], "+", k));
            }
        }
        return solver;
View Full Code Here
57
58
59
60
61
62
63
64
65
66
67
        for (int i = 0; i < n - 1; i++) {
            for (int j = i + 1; j < n; j++) {
                int k = j - i;
                Constraint neq = IntConstraintFactory.arithm(vars[i], "!=", vars[j]);
                solver.post(neq);
                solver.post(IntConstraintFactory.arithm(vars[i], "!=", vars[j], "+", -k));
                solver.post(IntConstraintFactory.arithm(vars[i], "!=", vars[j], "+", k));
            }
        }
        return solver;
    }
View Full Code Here
58
59
60
61
62
63
64
65
66
67
68
            for (int j = i + 1; j < n; j++) {
                int k = j - i;
                Constraint neq = IntConstraintFactory.arithm(vars[i], "!=", vars[j]);
                solver.post(neq);
                solver.post(IntConstraintFactory.arithm(vars[i], "!=", vars[j], "+", -k));
                solver.post(IntConstraintFactory.arithm(vars[i], "!=", vars[j], "+", k));
            }
        }
        return solver;
    }
View Full Code Here
57
58
59
60
61
62
63
64
65
66
67
        IntVar power = VariableFactory.enumerated("v_" + n, 0, 999999, s);
        IntVar[] objects = new IntVar[n];
        for (int i = 0; i < n; i++) {
            objects[i] = VariableFactory.enumerated("v_" + i, 0, nbOmax[i], s);
        }
        s.post(IntConstraintFactory.scalar(objects, volumes, VariableFactory.bounded("capa", capacites[0], capacites[1], s)));
        s.post(IntConstraintFactory.scalar(objects, energies, power));
        s.set(IntStrategyFactory.lexico_LB(objects));
        return s;
    }
    ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
View Full Code Here
58
59
60
61
62
63
64
65
66
67
68
        IntVar[] objects = new IntVar[n];
        for (int i = 0; i < n; i++) {
            objects[i] = VariableFactory.enumerated("v_" + i, 0, nbOmax[i], s);
        }
        s.post(IntConstraintFactory.scalar(objects, volumes, VariableFactory.bounded("capa", capacites[0], capacites[1], s)));
        s.post(IntConstraintFactory.scalar(objects, energies, power));
        s.set(IntStrategyFactory.lexico_LB(objects));
        return s;
    }
    ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
    ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
View Full Code Here
47
48
49
50
51
52
53
54
55
56
57
    @Test
    public void dummy() {
        Solver solver = new Solver();
        BoolVar[] bvars = VF.boolArray("B", 4, solver);
        solver.post(ICF.arithm(bvars[2], "=", bvars[3]));
        solver.post(ICF.arithm(bvars[2], "!=", bvars[3]));
        solver.set(ISF.lexico_LB(bvars));
        ExplanationFactory.CBJ.plugin(solver, true);
        SMF.log(solver, true, true);
        solver.findAllSolutions();
View Full Code Here
64
65
66
67
68
69
70
71
72
73
74
        windows = VariableFactory.enumerated("windows", 0, horizon, solver);
        facade = VariableFactory.enumerated("facade", 0, horizon, solver);
        garden = VariableFactory.enumerated("garden", 0, horizon, solver);
        objective = VariableFactory.enumerated("moving", 0, horizon - 1, solver);

        solver.post(precedence(masonry, 7, carpentry, solver));
        solver.post(precedence(masonry, 7, plumbing, solver));
        solver.post(precedence(masonry, 7, ceiling, solver));
        solver.post(precedence(carpentry, 3, roofing, solver));
        solver.post(precedence(ceiling, 3, roofing, solver));
        solver.post(precedence(roofing, 1, windows, solver));
View Full Code Here
48
49
50
51
52
53
54
55
56
57
58
    @Test
    public void dummy() {
        Solver solver = new Solver();
        BoolVar[] bvars = VF.boolArray("B", 4, solver);
        solver.post(ICF.arithm(bvars[2], "=", bvars[3]));
        solver.post(ICF.arithm(bvars[2], "!=", bvars[3]));
        solver.set(ISF.lexico_LB(bvars));
        ExplanationFactory.CBJ.plugin(solver, true);
        SMF.log(solver, true, true);
        solver.findAllSolutions();
    }
View Full Code Here
65
66
67
68
69
70
71
72
73
74
75
        facade = VariableFactory.enumerated("facade", 0, horizon, solver);
        garden = VariableFactory.enumerated("garden", 0, horizon, solver);
        objective = VariableFactory.enumerated("moving", 0, horizon - 1, solver);

        solver.post(precedence(masonry, 7, carpentry, solver));
        solver.post(precedence(masonry, 7, plumbing, solver));
        solver.post(precedence(masonry, 7, ceiling, solver));
        solver.post(precedence(carpentry, 3, roofing, solver));
        solver.post(precedence(ceiling, 3, roofing, solver));
        solver.post(precedence(roofing, 1, windows, solver));
        solver.post(precedence(windows, 1, painting, solver));
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.