or-tools 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 4c1a98e064635d769266167b02b577b491df6d60a26e55e422e03d914d566fd3
+  data.tar.gz: 8c034b6766e1b5cb8fe2839afff09c6fe595fb56ab7587f61eba67322ab4470e
+SHA512:
+  metadata.gz: fdc91ed0bd1bc2b6ab1359a3dfad4a0ac0b68751886db1bed54a3b933198a9ead038238fdb9c0d2876a854b4885dbfe8d24f7f5ed540d34bb06c1033f4f3f897
+  data.tar.gz: 4eb55bac287388670459aaa37c9d0e9e8459da0a4328b98960dd9e315f9fd49279f1dacd7c9fdba6858c183deb8a56e9d0e958a5ac76eff19a1ae924b6e59d62

data/CHANGELOG.md

@@ -0,0 +1,3 @@
+## 0.1.0 (2020-02-12)
+
+- First release

data/LICENSE.txt

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   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.

data/NOTICE.txt

@@ -0,0 +1,13 @@
+Copyright 2020 Andrew Kane
+
+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.

data/README.md

@@ -0,0 +1,246 @@
+# OR-Tools
+
+[OR-Tools](https://developers.google.com/optimization/) - operations research tools - for Ruby
+
+## Installation
+
+Download the [OR-Tools C++ library](https://developers.google.com/optimization/install/cpp). Then run:
+
+```sh
+bundle config build.or-tools --with-or-tools-dir=/path/to/or-tools
+```
+
+Add this line to your application’s Gemfile:
+
+```ruby
+gem 'or-tools'
+```
+
+## Getting Started
+
+Constraint Optimization
+
+- [CP-SAT Solver](#cp-sat-solver)
+
+Bin Packing
+
+- [The Knapsack Problem](#the-knapsack-problem)
+
+Network Flows
+
+- [Maximum Flows](#maximum-flows)
+- [Minimum Cost Flows](#minimum-cost-flows)
+
+### CP-SAT Solver
+
+[Guide](https://developers.google.com/optimization/cp/cp_solver)
+
+Declare the model
+
+```ruby
+model = ORTools::CpModel.new
+```
+
+Create the variables
+
+```ruby
+num_vals = 3
+x = model.new_int_var(0, num_vals - 1, "x")
+y = model.new_int_var(0, num_vals - 1, "y")
+z = model.new_int_var(0, num_vals - 1, "z")
+```
+
+Create the constraint
+
+```ruby
+model.add_not_equal(x, y)
+```
+
+Call the solver
+
+```ruby
+solver = ORTools::CpSolver.new
+status = solver.solve(model)
+```
+
+Display the first solution
+
+```ruby
+if status == :feasible
+  puts "x = #{solver.value(x)}"
+  puts "y = #{solver.value(y)}"
+  puts "z = #{solver.value(z)}"
+end
+```
+
+### The Knapsack Problem
+
+[Guide](https://developers.google.com/optimization/bin/knapsack)
+
+Create the data
+
+```ruby
+values = [
+  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
+]
+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
+]]
+capacities = [850]
+```
+
+Declare the solver
+
+```ruby
+solver = ORTools::KnapsackSolver.new(:branch_and_bound, "KnapsackExample")
+```
+
+Call the solver
+
+```ruby
+solver.init(values, weights, capacities)
+computed_value = solver.solve
+
+packed_items = []
+packed_weights = []
+total_weight = 0
+puts "Total value = #{computed_value}"
+values.length.times do |i|
+  if solver.best_solution_contains?(i)
+    packed_items << i
+    packed_weights << weights[0][i]
+    total_weight += weights[0][i]
+  end
+end
+puts "Total weight: #{total_weight}"
+puts "Packed items: #{packed_items}"
+puts "Packed weights: #{packed_weights}"
+```
+
+### Maximum Flows
+
+[Guide](https://developers.google.com/optimization/flow/maxflow)
+
+Define the data
+
+```ruby
+start_nodes = [0, 0, 0, 1, 1, 2, 2, 3, 3]
+end_nodes = [1, 2, 3, 2, 4, 3, 4, 2, 4]
+capacities = [20, 30, 10, 40, 30, 10, 20, 5, 20]
+```
+
+Declare the solver and add the arcs
+
+```ruby
+max_flow = ORTools::SimpleMaxFlow.new
+
+start_nodes.length.times do |i|
+  max_flow.add_arc_with_capacity(start_nodes[i], end_nodes[i], capacities[i])
+end
+```
+
+Invoke the solver and display the results
+
+```ruby
+if max_flow.solve(0, 4) == :optimal
+  puts "Max flow: #{max_flow.optimal_flow}"
+  puts
+  puts "  Arc    Flow / Capacity"
+  max_flow.num_arcs.times do |i|
+    puts "%1s -> %1s   %3s  / %3s" % [
+      max_flow.tail(i),
+      max_flow.head(i),
+      max_flow.flow(i),
+      max_flow.capacity(i)
+    ]
+  end
+  puts "Source side min-cut: #{max_flow.source_side_min_cut}"
+  puts "Sink side min-cut: #{max_flow.sink_side_min_cut}"
+else
+  puts "There was an issue with the max flow input."
+end
+```
+
+### Minimum Cost Flows
+
+[Guide](https://developers.google.com/optimization/flow/mincostflow)
+
+Define the data
+
+```ruby
+start_nodes = [ 0, 0,  1, 1,  1,  2, 2,  3, 4]
+end_nodes   = [ 1, 2,  2, 3,  4,  3, 4,  4, 2]
+capacities  = [15, 8, 20, 4, 10, 15, 4, 20, 5]
+unit_costs  = [ 4, 4,  2, 2,  6,  1, 3,  2, 3]
+supplies = [20, 0, 0, -5, -15]
+```
+
+Declare the solver and add the arcs
+
+```ruby
+min_cost_flow = ORTools::SimpleMinCostFlow.new
+
+start_nodes.length.times do |i|
+  min_cost_flow.add_arc_with_capacity_and_unit_cost(
+    start_nodes[i], end_nodes[i], capacities[i], unit_costs[i]
+  )
+end
+
+supplies.length.times do |i|
+  min_cost_flow.set_node_supply(i, supplies[i])
+end
+```
+
+Invoke the solver and display the results
+
+```ruby
+if min_cost_flow.solve == :optimal
+  puts "Minimum cost #{min_cost_flow.optimal_cost}"
+  puts
+  puts "  Arc    Flow / Capacity  Cost"
+  min_cost_flow.num_arcs.times do |i|
+    cost = min_cost_flow.flow(i) * min_cost_flow.unit_cost(i)
+    puts "%1s -> %1s   %3s  / %3s       %3s" % [
+      min_cost_flow.tail(i),
+      min_cost_flow.head(i),
+      min_cost_flow.flow(i),
+      min_cost_flow.capacity(i),
+      cost
+    ]
+  end
+else
+  puts "There was an issue with the min cost flow input."
+end
+```
+
+## History
+
+View the [changelog](https://github.com/ankane/or-tools/blob/master/CHANGELOG.md)
+
+## Contributing
+
+Everyone is encouraged to help improve this project. Here are a few ways you can help:
+
+- [Report bugs](https://github.com/ankane/or-tools/issues)
+- Fix bugs and [submit pull requests](https://github.com/ankane/or-tools/pulls)
+- Write, clarify, or fix documentation
+- Suggest or add new features
+
+To get started with development:
+
+```sh
+git clone https://github.com/ankane/or-tools.git
+cd or-tools
+bundle install
+bundle exec rake compile -- --with-or-tools-dir=/path/to/or-tools
+bundle exec rake test
+```
+
+Resources
+
+- [OR-Tools Reference](https://developers.google.com/optimization/reference)

data/ext/or-tools/ext.cpp

@@ -0,0 +1,221 @@
+// or-tools
+#include <ortools/sat/cp_model.h>
+#include <ortools/algorithms/knapsack_solver.h>
+#include <ortools/graph/max_flow.h>
+#include <ortools/graph/min_cost_flow.h>
+
+// rice
+#include <rice/Array.hpp>
+#include <rice/Class.hpp>
+#include <rice/Constructor.hpp>
+#include <rice/Hash.hpp>
+#include <rice/Module.hpp>
+#include <rice/Symbol.hpp>
+
+using operations_research::ArcIndex;
+using operations_research::Domain;
+using operations_research::FlowQuantity;
+using operations_research::KnapsackSolver;
+using operations_research::NodeIndex;
+using operations_research::SimpleMaxFlow;
+using operations_research::SimpleMinCostFlow;
+
+using operations_research::sat::CpModelBuilder;
+using operations_research::sat::CpSolverResponse;
+using operations_research::sat::CpSolverStatus;
+using operations_research::sat::IntVar;
+using operations_research::sat::SolutionIntegerValue;
+
+using Rice::Array;
+using Rice::Constructor;
+using Rice::Hash;
+using Rice::Module;
+using Rice::Object;
+using Rice::Symbol;
+using Rice::define_module;
+using Rice::define_class_under;
+
+template<>
+inline
+KnapsackSolver::SolverType from_ruby<KnapsackSolver::SolverType>(Object x)
+{
+  std::string s = Symbol(x).str();
+  if (s == "branch_and_bound") {
+    return KnapsackSolver::KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER;
+  } else {
+    throw std::runtime_error("Unknown solver type: " + s);
+  }
+}
+
+extern "C"
+void Init_ext()
+{
+  Module rb_mORTools = define_module("ORTools");
+
+  define_class_under<IntVar>(rb_mORTools, "IntVar");
+
+  define_class_under<CpModelBuilder>(rb_mORTools, "CpModel")
+    .define_constructor(Constructor<CpModelBuilder>())
+    .define_method(
+      "new_int_var",
+      *[](CpModelBuilder& self, int64 start, int64 end, std::string name) {
+        const Domain domain(start, end);
+        return self.NewIntVar(domain).WithName(name);
+      })
+    .define_method(
+      "add_not_equal",
+      *[](CpModelBuilder& self, IntVar x, IntVar y) {
+        // TODO return value
+        self.AddNotEqual(x, y);
+      });
+
+  define_class_under(rb_mORTools, "CpSolver")
+    .define_method(
+      "_solve",
+      *[](Object self, CpModelBuilder& model) {
+        return Solve(model.Build());
+      })
+    .define_method(
+      "_solution_integer_value",
+      *[](Object self, CpSolverResponse& response, IntVar& x) {
+        return SolutionIntegerValue(response, x);
+      });
+
+  define_class_under<CpSolverResponse>(rb_mORTools, "CpSolverResponse")
+    .define_method(
+      "status",
+      *[](CpSolverResponse& self) {
+        auto status = self.status();
+        if (status == CpSolverStatus::OPTIMAL) {
+          return Symbol("optimal");
+        } else if (status == CpSolverStatus::FEASIBLE) {
+          return Symbol("feasible");
+        } else if (status == CpSolverStatus::INFEASIBLE) {
+          return Symbol("infeasible");
+        } else if (status == CpSolverStatus::MODEL_INVALID) {
+          return Symbol("model_invalid");
+        } else {
+          throw std::runtime_error("Unknown solver status");
+        }
+      });
+
+  define_class_under<KnapsackSolver>(rb_mORTools, "KnapsackSolver")
+    .define_constructor(Constructor<KnapsackSolver, KnapsackSolver::SolverType, std::string>())
+    .define_method("_solve", &KnapsackSolver::Solve)
+    .define_method("best_solution_contains?", &KnapsackSolver::BestSolutionContains)
+    .define_method(
+      "init",
+      *[](KnapsackSolver& self, Array rb_values, Array rb_weights, Array rb_capacities) {
+        std::vector<int64> values;
+        for (std::size_t i = 0; i < rb_values.size(); ++i) {
+          values.push_back(from_ruby<int64>(rb_values[i]));
+        }
+
+        std::vector<std::vector<int64>> weights;
+        for (std::size_t i = 0; i < rb_weights.size(); ++i) {
+          Array rb_w = Array(rb_weights[i]);
+          std::vector<int64> w;
+          for (std::size_t j = 0; j < rb_w.size(); ++j) {
+            w.push_back(from_ruby<int64>(rb_w[j]));
+          }
+          weights.push_back(w);
+        }
+
+        std::vector<int64> capacities;
+        for (std::size_t i = 0; i < rb_capacities.size(); ++i) {
+          capacities.push_back(from_ruby<int64>(rb_capacities[i]));
+        }
+
+        self.Init(values, weights, capacities);
+      });
+
+  define_class_under<SimpleMaxFlow>(rb_mORTools, "SimpleMaxFlow")
+    .define_constructor(Constructor<SimpleMaxFlow>())
+    .define_method("add_arc_with_capacity", &SimpleMaxFlow::AddArcWithCapacity)
+    .define_method("num_nodes", &SimpleMaxFlow::NumNodes)
+    .define_method("num_arcs", &SimpleMaxFlow::NumArcs)
+    .define_method("tail", &SimpleMaxFlow::Tail)
+    .define_method("head", &SimpleMaxFlow::Head)
+    .define_method("capacity", &SimpleMaxFlow::Capacity)
+    .define_method("optimal_flow", &SimpleMaxFlow::OptimalFlow)
+    .define_method("flow", &SimpleMaxFlow::Flow)
+    .define_method(
+      "solve",
+      *[](SimpleMaxFlow& self, NodeIndex source, NodeIndex sink) {
+        auto status = self.Solve(source, sink);
+
+        if (status == SimpleMaxFlow::Status::OPTIMAL) {
+          return Symbol("optimal");
+        } else if (status == SimpleMaxFlow::Status::POSSIBLE_OVERFLOW) {
+          return Symbol("possible_overflow");
+        } else if (status == SimpleMaxFlow::Status::BAD_INPUT) {
+          return Symbol("bad_input");
+        } else if (status == SimpleMaxFlow::Status::BAD_RESULT) {
+          return Symbol("bad_result");
+        } else {
+          throw std::runtime_error("Unknown status");
+        }
+      })
+    .define_method(
+      "source_side_min_cut",
+      *[](SimpleMaxFlow& self) {
+        std::vector<NodeIndex> result;
+        self.GetSourceSideMinCut(&result);
+
+        Array ret;
+        for(auto const& it: result) {
+          ret.push(it);
+        }
+        return ret;
+      })
+    .define_method(
+      "sink_side_min_cut",
+      *[](SimpleMaxFlow& self) {
+        std::vector<NodeIndex> result;
+        self.GetSinkSideMinCut(&result);
+
+        Array ret;
+        for(auto const& it: result) {
+          ret.push(it);
+        }
+        return ret;
+      });
+
+  define_class_under<SimpleMinCostFlow>(rb_mORTools, "SimpleMinCostFlow")
+    .define_constructor(Constructor<SimpleMinCostFlow>())
+    .define_method("add_arc_with_capacity_and_unit_cost", &SimpleMinCostFlow::AddArcWithCapacityAndUnitCost)
+    .define_method("set_node_supply", &SimpleMinCostFlow::SetNodeSupply)
+    .define_method("optimal_cost", &SimpleMinCostFlow::OptimalCost)
+    .define_method("maximum_flow", &SimpleMinCostFlow::MaximumFlow)
+    .define_method("flow", &SimpleMinCostFlow::Flow)
+    .define_method("num_nodes", &SimpleMinCostFlow::NumNodes)
+    .define_method("num_arcs", &SimpleMinCostFlow::NumArcs)
+    .define_method("tail", &SimpleMinCostFlow::Tail)
+    .define_method("head", &SimpleMinCostFlow::Head)
+    .define_method("capacity", &SimpleMinCostFlow::Capacity)
+    .define_method("supply", &SimpleMinCostFlow::Supply)
+    .define_method("unit_cost", &SimpleMinCostFlow::UnitCost)
+    .define_method(
+      "solve",
+      *[](SimpleMinCostFlow& self) {
+        auto status = self.Solve();
+
+        if (status == SimpleMinCostFlow::Status::NOT_SOLVED) {
+          return Symbol("not_solved");
+        } else if (status == SimpleMinCostFlow::Status::OPTIMAL) {
+          return Symbol("optimal");
+        } else if (status == SimpleMinCostFlow::Status::FEASIBLE) {
+          return Symbol("feasible");
+        } else if (status == SimpleMinCostFlow::Status::INFEASIBLE) {
+          return Symbol("infeasible");
+        } else if (status == SimpleMinCostFlow::Status::UNBALANCED) {
+          return Symbol("unbalanced");
+        } else if (status == SimpleMinCostFlow::Status::BAD_RESULT) {
+          return Symbol("bad_result");
+        } else if (status == SimpleMinCostFlow::Status::BAD_COST_RANGE) {
+          return Symbol("bad_cost_range");
+        } else {
+          throw std::runtime_error("Unknown status");
+        }
+      });
+}

data/ext/or-tools/extconf.rb

@@ -0,0 +1,21 @@
+require "mkmf-rice"
+
+abort "Missing stdc++" unless have_library("stdc++")
+
+$CXXFLAGS << " -std=c++11"
+
+# or-tools warnings
+$CXXFLAGS << " -Wno-sign-compare -Wno-shorten-64-to-32 -Wno-ignored-qualifiers"
+
+inc, lib = dir_config("or-tools")
+
+inc ||= "/usr/local/include"
+lib ||= "/usr/local/lib"
+
+$INCFLAGS << " -I#{inc}"
+
+$LDFLAGS << " -Wl,-rpath,#{lib}"
+$LDFLAGS << " -L#{lib}"
+$LDFLAGS << " -lortools"
+
+create_makefile("or_tools/ext")

data/lib/or-tools.rb

@@ -0,0 +1,11 @@
+# ext
+require "or_tools/ext"
+
+# modules
+require "or_tools/cp_solver"
+require "or_tools/knapsack_solver"
+require "or_tools/version"
+
+module ORTools
+  class Error < StandardError; end
+end

data/lib/or_tools/cp_solver.rb

@@ -0,0 +1,12 @@
+module ORTools
+  class CpSolver
+    def solve(model)
+      @response = _solve(model)
+      @response.status
+    end
+
+    def value(var)
+      _solution_integer_value(@response, var)
+    end
+  end
+end

data/lib/or_tools/knapsack_solver.rb

@@ -0,0 +1,34 @@
+module ORTools
+  class KnapsackSolver
+    def self.new(*args)
+      args = [:branch_and_bound, "KnapsackExample"] if args.empty?
+      super(*args)
+    end
+
+    def solve(*args)
+      return _solve if args.empty?
+
+      values, weights, capacities = *args
+      init(values, weights, capacities)
+      computed_value = _solve
+
+      packed_items = []
+      packed_weights = []
+      total_weight = 0
+      values.length.times do |i|
+        if best_solution_contains?(i)
+          packed_items << i
+          packed_weights << weights[0][i]
+          total_weight += weights[0][i]
+        end
+      end
+
+      {
+        total_value: computed_value,
+        total_weight: total_weight,
+        packed_items: packed_items,
+        packed_weights: packed_weights
+      }
+    end
+  end
+end

data/lib/or_tools/version.rb

@@ -0,0 +1,3 @@
+module ORTools
+  VERSION = "0.1.0"
+end

metadata

@@ -0,0 +1,124 @@
+--- !ruby/object:Gem::Specification
+name: or-tools
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Andrew Kane
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2020-02-13 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rice
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '2.2'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '2.2'
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: rake-compiler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: minitest
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '5'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '5'
+description: 
+email: andrew@chartkick.com
+executables: []
+extensions:
+- ext/or-tools/extconf.rb
+extra_rdoc_files: []
+files:
+- CHANGELOG.md
+- LICENSE.txt
+- NOTICE.txt
+- README.md
+- ext/or-tools/ext.cpp
+- ext/or-tools/extconf.rb
+- lib/or-tools.rb
+- lib/or_tools/cp_solver.rb
+- lib/or_tools/ext.bundle
+- lib/or_tools/knapsack_solver.rb
+- lib/or_tools/version.rb
+homepage: https://github.com/ankane/or-tools
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '2.4'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.1.2
+signing_key: 
+specification_version: 4
+summary: Operations research tools for Ruby
+test_files: []