Examples of samples.integer.GolombRuler

samples.integer.GolombRuler
CSPLib prob006:
A Golomb ruler may be defined as a set of m integers 0 = a_1 < a_2 < ... < a_m such that the m(m-1)/2 differences a_j - a_i, 1 <= i < j <= m are distinct. Such a ruler is said to contain m marks and is of length a_m.
The objective is to find optimal (minimum length) or near optimal rulers.
@author Charles Prud'homme @revision 04/03/12 revise model : remove views @since 31/03/11

    public final static int[][] OPTIMAL_RULER = {
            {5, 11}, {6, 17}, {7, 25}, {8, 34}, {9, 44}, {10, 55}, {11, 72}
    };


    protected Solver modeler(int m) {
        GolombRuler pb = new GolombRuler();
        pb.readArgs("-m", Integer.toString(m));
        pb.createSolver();
        pb.buildModel();
        pb.configureSearch();
        return pb.getSolver();
    }

View Full Code Here

TOP

Related Classes of samples.integer.GolombRuler

samples.GolombRulerTest

solver.Solver

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.