b027e57e95
- Currently not implemented... Add abseil patch - Add patches/absl-config.cmake Makefile: Add abseil-cpp on unix - Force abseil-cpp SHA1 to 45221cc note: Just before the PR #136 which break all CMake Makefile: Add abseil-cpp on windows - Force abseil-cpp SHA1 to 45221cc note: Just before the PR #136 which break all CMake CMake: Add abseil-cpp - Force abseil-cpp SHA1 to 45221cc note: Just before the PR #136 which break all CMake port to absl: C++ Part - Fix warning with the use of ABSL_MUST_USE_RESULT > The macro must appear as the very first part of a function declaration or definition: ... Note: past advice was to place the macro after the argument list. src: dependencies/sources/abseil-cpp-master/absl/base/attributes.h:418 - Rename enum after windows clash - Remove non compact table constraints - Change index type from int64 to int in routing library - Fix file_nonport compilation on windows - Fix another naming conflict with windows (NO_ERROR is a macro) - Cleanup hash containers; work on sat internals - Add optional_boolean sub-proto Sync cpp examples with internal code - reenable issue173 after reducing number of loops port to absl: Python Part - Add back cp_model.INT32_MIN|MAX for examples Update Python examples - Add random_tsp.py - Run words_square example - Run magic_square in python tests port to absl: Java Part - Fix compilation of the new routing parameters in java - Protect some code from SWIG parsing Update Java Examples port to absl: .Net Part Update .Net examples work on sat internals; Add C++ CP-SAT CpModelBuilder API; update sample code and recipes to use the new API; sync with internal code Remove VS 2015 in Appveyor-CI - abseil-cpp does not support VS 2015... improve tables upgrade C++ sat examples to use the new API; work on sat internals update license dates rewrite jobshop_ft06_distance.py to use the CP-SAT solver rename last example revert last commit more work on SAT internals fix
97 lines
2.7 KiB
Java
97 lines
2.7 KiB
Java
// Copyright 2011 Hakan Kjellerstrand hakank@gmail.com
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
import com.google.ortools.constraintsolver.DecisionBuilder;
|
|
import com.google.ortools.constraintsolver.IntVar;
|
|
import com.google.ortools.constraintsolver.Solver;
|
|
import java.io.*;
|
|
import java.text.*;
|
|
import java.util.*;
|
|
|
|
public class AllInterval {
|
|
|
|
static {
|
|
System.loadLibrary("jniortools");
|
|
}
|
|
|
|
/**
|
|
* Implements the all interval problem. See http://www.hakank.org/google_or_tools/all_interval.py
|
|
*/
|
|
private static void solve(int n) {
|
|
|
|
Solver solver = new Solver("AllInterval");
|
|
|
|
//
|
|
// variables
|
|
//
|
|
IntVar[] x = solver.makeIntVarArray(n, 0, n - 1, "x");
|
|
IntVar[] diffs = solver.makeIntVarArray(n - 1, 1, n - 1, "diffs");
|
|
|
|
//
|
|
// constraints
|
|
//
|
|
solver.addConstraint(solver.makeAllDifferent(x));
|
|
solver.addConstraint(solver.makeAllDifferent(diffs));
|
|
|
|
for (int k = 0; k < n - 1; k++) {
|
|
solver.addConstraint(
|
|
solver.makeEquality(
|
|
diffs[k], solver.makeAbs(solver.makeDifference(x[k + 1], x[k])).var()));
|
|
}
|
|
|
|
// symmetry breaking
|
|
solver.addConstraint(solver.makeLess(x[0], x[n - 1]));
|
|
solver.addConstraint(solver.makeLess(diffs[0], diffs[1]));
|
|
|
|
//
|
|
// search
|
|
//
|
|
DecisionBuilder db = solver.makePhase(x, solver.CHOOSE_FIRST_UNBOUND, solver.ASSIGN_MIN_VALUE);
|
|
|
|
solver.newSearch(db);
|
|
|
|
//
|
|
// output
|
|
//
|
|
while (solver.nextSolution()) {
|
|
System.out.print("x : ");
|
|
for (int i = 0; i < n; i++) {
|
|
System.out.print(x[i].value() + " ");
|
|
}
|
|
System.out.print("\ndiffs: ");
|
|
|
|
for (int i = 0; i < n - 1; i++) {
|
|
System.out.print(diffs[i].value() + " ");
|
|
}
|
|
System.out.println("\n");
|
|
}
|
|
solver.endSearch();
|
|
|
|
// Statistics
|
|
System.out.println();
|
|
System.out.println("Solutions: " + solver.solutions());
|
|
System.out.println("Failures: " + solver.failures());
|
|
System.out.println("Branches: " + solver.branches());
|
|
System.out.println("Wall time: " + solver.wallTime() + "ms");
|
|
}
|
|
|
|
public static void main(String[] args) throws Exception {
|
|
|
|
int n = 12;
|
|
if (args.length > 0) {
|
|
n = Integer.parseInt(args[0]);
|
|
}
|
|
|
|
AllInterval.solve(n);
|
|
}
|
|
}
|