Examples of solver.Solver.post()

solver.Solver.post()
Post permanently a constraint c in the constraints network of this: - add it to the data structure, - set the fixed idx, - checks for restrictions @param c a Constraint

                    VF.offset(S, i + 1)
            );
            HE[i] = VF.bounded("HE_" + i, i - 1, i + 1, solver);
        }
        IntVar CA = VF.enumerated("CA", 1, 3, solver);
        solver.post(ICF.cumulative(TS, HE, CA, true));
        SMF.log(solver, true, false);
        solver.findAllSolutions();
    }


    @Test(groups = "1s")

View Full Code Here

        IntVar[] W = new IntVar[4];
        for (int i = 0; i < 4; i++) {
            D[i] = VF.fixed("D_" + i, 1, solver);
            W[i] = VF.fixed("W_" + i, i + 1, solver);
        }
        solver.post(ICF.diffn(X, Y, D, W, true));
        SMF.log(solver, true, false);
        solver.findAllSolutions();
    }


    @Test(groups = "1s")

View Full Code Here

    public void testglobal_cardinality() {
        Solver solver = new Solver();
        IntVar[] VS = VF.boundedArray("VS", 4, 0, 4, solver);
        int[] values = new int[]{-1, 1, 2};
        IntVar[] OCC = VF.boundedArray("OCC", 3, 0, 2, solver);
        solver.post(ICF.global_cardinality(VS, values, OCC, true));
        SMF.log(solver, true, false);
        solver.findAllSolutions();
    }


    @Test(groups = "1s")

View Full Code Here

    @Test(groups = "1s")
    public void testinverse_channeling() {
        Solver solver = new Solver();
        IntVar[] X = VF.enumeratedArray("X", 3, 0, 3, solver);
        IntVar[] Y = VF.enumeratedArray("Y", 3, 1, 4, solver);
        solver.post(ICF.inverse_channeling(X, Y, 0, 1));
        SMF.log(solver, true, false);
        solver.findAllSolutions();
    }


    @Test(groups = "1s")

View Full Code Here

        IT[2] = VF.bounded("IT_2", 0, 1, solver);
        IntVar WE = VF.bounded("WE", 0, 8, solver);
        IntVar EN = VF.bounded("EN", 0, 6, solver);
        int[] weights = new int[]{1, 3, 4};
        int[] energies = new int[]{1, 4, 6};
        solver.post(ICF.knapsack(IT, WE, EN, weights, energies));
        SMF.log(solver, true, false);
        solver.findAllSolutions();
    }


    @Test(groups = "1s")

View Full Code Here

    public void testlex_chain_less() {
        Solver solver = new Solver();
        IntVar[] X = VF.enumeratedArray("X", 3, -1, 1, solver);
        IntVar[] Y = VF.enumeratedArray("Y", 3, 1, 2, solver);
        IntVar[] Z = VF.enumeratedArray("Z", 3, 0, 2, solver);
        solver.post(ICF.lex_chain_less(X, Y, Z));
        SMF.log(solver, true, false);
        solver.findAllSolutions();
    }


    @Test(groups = "1s")

View Full Code Here

    public void testlex_chain_less_eq() {
        Solver solver = new Solver();
        IntVar[] X = VF.enumeratedArray("X", 3, -1, 1, solver);
        IntVar[] Y = VF.enumeratedArray("Y", 3, 1, 2, solver);
        IntVar[] Z = VF.enumeratedArray("Z", 3, 0, 2, solver);
        solver.post(ICF.lex_chain_less_eq(X, Y, Z));
        SMF.log(solver, true, false);
        solver.findAllSolutions();
    }


    @Test(groups = "1s")

View Full Code Here

    @Test(groups = "1s")
    public void testlex_less() {
        Solver solver = new Solver();
        IntVar[] X = VF.enumeratedArray("X", 3, -1, 1, solver);
        IntVar[] Y = VF.enumeratedArray("Y", 3, 1, 2, solver);
        solver.post(ICF.lex_less(X, Y));
        SMF.log(solver, true, false);
        solver.findAllSolutions();
    }


    @Test(groups = "1s")

View Full Code Here

    @Test(groups = "1s")
    public void testlex_less_eq() {
        Solver solver = new Solver();
        IntVar[] X = VF.enumeratedArray("X", 3, -1, 1, solver);
        IntVar[] Y = VF.enumeratedArray("Y", 3, 1, 2, solver);
        solver.post(ICF.lex_less_eq(X, Y));
        SMF.log(solver, true, false);
        solver.findAllSolutions();
    }


    @Test(groups = "1s")

View Full Code Here

//        costs[1] = new int[]{2, 3, 1};
//        costs[2] = new int[]{3, 1, 2};
//        costs[3] = new int[]{3, 2, 1};
//        costs[4] = new int[]{2, 1, 3};


        solver.post(ICF.multicost_regular(VARS, CVARS, CostAutomaton.makeMultiResources(fauto, costs, CVARS)));
        SMF.log(solver, true, false);
        solver.findAllSolutions();
    }


    @Test(groups = "1s")

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

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.