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
62 lines
1.9 KiB
Java
62 lines
1.9 KiB
Java
// Copyright 2010-2018 Google LLC
|
|
// 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.algorithms.KnapsackSolver;
|
|
|
|
/** Sample showing how to model using the knapsack solver. */
|
|
public class Knapsack {
|
|
static {
|
|
System.loadLibrary("jniortools");
|
|
}
|
|
|
|
private static void solve() {
|
|
KnapsackSolver solver =
|
|
new KnapsackSolver(
|
|
KnapsackSolver.SolverType.KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER, "test");
|
|
final long[] profits = {
|
|
360, 83, 59, 130, 431, 67, 230, 52, 93,
|
|
125, 670, 892, 600, 38, 48, 147, 78, 256,
|
|
63, 17, 120, 164, 432, 35, 92, 110, 22,
|
|
42, 50, 323, 514, 28, 87, 73, 78, 15,
|
|
26, 78, 210, 36, 85, 189, 274, 43, 33,
|
|
10, 19, 389, 276, 312
|
|
};
|
|
|
|
final long[][] weights = {
|
|
{
|
|
7, 0, 30, 22, 80, 94, 11, 81, 70,
|
|
64, 59, 18, 0, 36, 3, 8, 15, 42,
|
|
9, 0, 42, 47, 52, 32, 26, 48, 55,
|
|
6, 29, 84, 2, 4, 18, 56, 7, 29,
|
|
93, 44, 71, 3, 86, 66, 31, 65, 0,
|
|
79, 20, 65, 52, 13
|
|
}
|
|
};
|
|
|
|
final long[] capacities = {850};
|
|
|
|
final long optimalProfit = 7534;
|
|
System.out.println("Solving knapsack with " + profits.length + " items");
|
|
|
|
solver.init(profits, weights, capacities);
|
|
|
|
final long computedProfit = solver.solve();
|
|
|
|
System.out.println("Optimal_Profit = " + computedProfit + "/" + optimalProfit);
|
|
}
|
|
|
|
public static void main(String[] args) throws Exception {
|
|
Knapsack.solve();
|
|
}
|
|
}
|