Google OR-Tools
Open-source combinatorial-optimization suite with knapsack and integer-programming solvers.
Also called: Google OR-Tools · OR-Tools · ortools
A general-purpose open-source solver suite used to actually solve the formal
problems of cutting & packing (classified as a tool in v1, grade C — project /
vendor documentation). The 0/1 Knapsack Problem is
handled by OR-Tools' KnapsackSolver, and
integer linear programming formulations by
its CP-SAT / MIP solvers. It is not specialized for geometric problems such as
nesting.
Claims & evidence
Every relationship is a claim with an evidence grade; applicable problem-to-problem relationships also carry an equivalence level. See the evidence policy.
A–X describes evidence reliability; E0–E4 describes mathematical similarity between problems. The two axes are independent.
Relationships to this entry 2
- open-source implementation
Google OR-Tools provides an open-source KnapsackSolver for the 0/1 knapsack problem.
EvidenceC · Vendor / case-reportedSources
- open-source implementation
Google OR-Tools provides open-source MIP and CP-SAT solvers for integer linear programs.
EvidenceC · Vendor / case-reportedSources
| Relationship | Claim | Evidence | Equiv. | Sources |
|---|---|---|---|---|
open-source implementation | Google OR-Tools provides an open-source KnapsackSolver for the 0/1 knapsack problem. | C · Vendor / case-reported | — | |
open-source implementation | Google OR-Tools provides open-source MIP and CP-SAT solvers for integer linear programs. | C · Vendor / case-reported | — |