[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"project-75767":3},{"id":4,"name":5,"fullName":6,"owner":7,"repo":5,"description":8,"homepage":9,"htmlUrl":10,"language":11,"languages":9,"totalLinesOfCode":9,"stars":12,"forks":13,"watchers":14,"openIssues":15,"contributorsCount":9,"subscribersCount":16,"size":16,"stars1d":17,"stars7d":18,"stars30d":19,"stars90d":16,"forks30d":16,"starsTrendScore":20,"compositeScore":21,"rankGlobal":9,"rankLanguage":9,"license":9,"archived":22,"fork":22,"defaultBranch":23,"hasWiki":22,"hasPages":22,"topics":24,"createdAt":9,"pushedAt":9,"updatedAt":29,"readmeContent":30,"aiSummary":31,"trendingCount":16,"starSnapshotCount":16,"syncStatus":32,"lastSyncTime":33,"discoverSource":34},75767,"or-tools","google\u002For-tools","google","Google's Operations Research tools:",null,"https:\u002F\u002Fgithub.com\u002Fgoogle\u002For-tools","C++",13608,2409,309,82,0,24,61,132,72,45,false,"main",[25,26,27,28,5],"combinatorial-optimization","linear-programming","operations-research","optimization","2026-06-12 02:03:35","# OR-Tools - Google Optimization Tools\n\n[![PyPI version](https:\u002F\u002Fimg.shields.io\u002Fpypi\u002Fv\u002Fortools.svg)](https:\u002F\u002Fpypi.org\u002Fproject\u002Fortools\u002F)\n[![PyPI download](https:\u002F\u002Fimg.shields.io\u002Fpypi\u002Fdm\u002Fortools.svg)](https:\u002F\u002Fpypi.org\u002Fproject\u002Fortools\u002F#files)\n\\\n[![NuGet version](https:\u002F\u002Fimg.shields.io\u002Fnuget\u002Fv\u002FGoogle.OrTools.svg)](https:\u002F\u002Fwww.nuget.org\u002Fpackages\u002FGoogle.OrTools)\n[![NuGet download](https:\u002F\u002Fimg.shields.io\u002Fnuget\u002Fdt\u002FGoogle.OrTools.svg)](https:\u002F\u002Fwww.nuget.org\u002Fpackages\u002FGoogle.OrTools)\n\\\n[![Maven Central](https:\u002F\u002Fimg.shields.io\u002Fmaven-central\u002Fv\u002Fcom.google.ortools\u002Fortools-java)](https:\u002F\u002Fmvnrepository.com\u002Fartifact\u002Fcom.google.ortools\u002Fortools-java)\n\\\n[![Discord](https:\u002F\u002Fimg.shields.io\u002Fdiscord\u002F693088862481678374?color=7289DA&logo=discord&style=plastic)](https:\u002F\u002Fdiscord.gg\u002FENkQrdf)\n\nGoogle's software suite for combinatorial optimization.\n\n## Table of Contents\n\n*   [About OR-Tools](#about)\n*   [Codemap](#codemap)\n*   [Installation](#installation)\n*   [Quick Start](#quick-start)\n*   [Documentation](#documentation)\n*   [Contributing](#contributing)\n*   [License](#license)\n\n\u003Ca name=\"about\">\u003C\u002Fa>\n## About OR-Tools\n\nGoogle Optimization Tools (a.k.a., OR-Tools) is an open-source, fast and\nportable software suite for solving combinatorial optimization problems.\n\nThe suite contains:\n\n*   Two constraint programming solver (CP* and CP-SAT);\n*   Two linear programming solvers (Glop and PDLP);\n*   Wrappers around commercial and other open source solvers, including mixed\n    integer solvers;\n*   Bin packing and knapsack algorithms;\n*   Algorithms for the Traveling Salesman Problem and Vehicle Routing Problem;\n*   Graph algorithms (shortest paths, min cost flow, max flow, linear sum\n    assignment).\n\nWe wrote OR-Tools in C++, but provide wrappers in Python, C# and Java.\n\n## Codemap\n\nThis software suite is composed of the following components:\n\n*   [Makefile](Makefile) Top-level for\n    [GNU Make](https:\u002F\u002Fwww.gnu.org\u002Fsoftware\u002Fmake\u002Fmanual\u002Fmake.html) based build.\n*   [makefiles](makefiles) Subsidiary Make files, CI and build system documentation.\n*   [CMakeLists.txt](CMakeLists.txt) Top-level for\n    [CMake](https:\u002F\u002Fcmake.org\u002Fcmake\u002Fhelp\u002Flatest\u002F) based build.\n*   [cmake](cmake) Subsidiary CMake files, CI and build system documentation.\n*   [WORKSPACE](WORKSPACE) Top-level for\n    [Bazel](https:\u002F\u002Fbazel.build\u002Fstart\u002Fbazel-intro) based build.\n*   [bazel](bazel) Subsidiary Bazel files, CI and build system documentation.\n*   [ortools](ortools) Root directory for source code.\n    *   [base](ortools\u002Fbase) Basic utilities.\n    *   [algorithms](ortools\u002Falgorithms) Basic algorithms.\n        *   [samples](ortools\u002Falgorithms\u002Fsamples) Carefully crafted samples.\n    *   [graph](ortools\u002Fgraph) Graph algorithms.\n        *   [samples](ortools\u002Fgraph\u002Fsamples) Carefully crafted samples.\n    *   [linear_solver](ortools\u002Flinear_solver) Linear solver wrapper.\n        *   [samples](ortools\u002Flinear_solver\u002Fsamples) Carefully crafted samples.\n    *   [glop](ortools\u002Fglop) Simplex-based linear programming solver.\n        *   [samples](ortools\u002Fglop\u002Fsamples) Carefully crafted samples.\n    *   [pdlp](ortools\u002Fpdlp) First-order linear programming solver.\n        *   [samples](ortools\u002Fpdlp\u002Fsamples) Carefully crafted samples.\n    *   [lp_data](ortools\u002Flp_data) Data structures for linear models.\n    *   [constraint_solver](ortools\u002Fconstraint_solver) Constraint and Routing\n        solver.\n        *   [docs](ortools\u002Fconstraint_solver\u002Fdocs) Documentation of the component.\n        *   [samples](ortools\u002Fconstraint_solver\u002Fsamples) Carefully crafted samples.\n    *   [sat](ortools\u002Fsat) SAT solver.\n        *   [docs](ortools\u002Fsat\u002Fdocs) Documentation of the component.\n        *   [samples](ortools\u002Fsat\u002Fsamples) Carefully crafted samples.\n    *   [bop](ortools\u002Fbop) Boolean solver based on SAT.\n    *   [util](ortools\u002Futil) Utilities needed by the constraint solver\n*   [examples](examples) Root directory for all examples.\n    *   [contrib](examples\u002Fcontrib) Examples from the community.\n    *   [cpp](examples\u002Fcpp) C++ examples.\n    *   [dotnet](examples\u002Fdotnet) .Net examples.\n    *   [java](examples\u002Fjava) Java examples.\n    *   [python](examples\u002Fpython) Python examples.\n    *   [notebook](examples\u002Fnotebook) Jupyter\u002FIPython notebooks.\n    *   [flatzinc](examples\u002Fflatzinc) FlatZinc examples.\n*   [tools](tools) Delivery Tools (e.g. Windows GNU binaries, scripts, release dockers)\n\n## Installation\n\nThis software suite has been tested under:\n\n*   Ubuntu 18.04 LTS and up (64-bit);\n*   Apple macOS Mojave with Xcode 9.x (64-bit);\n*   Microsoft Windows with Visual Studio 2022 (64-bit).\n\nOR-Tools currently builds with a Makefile, but also provides Bazel and CMake\nsupport.\n\nFor installation instructions (both source and binary), please visit\nhttps:\u002F\u002Fdevelopers.google.com\u002Foptimization\u002Fintroduction\u002Finstalling.\n\n### Build from source using Make (legacy)\n\nWe provide a Make based build.\u003Cbr>Please check the\n[Make build instructions](makefiles\u002FREADME.md).\n\n### Build from source using CMake\n\nWe provide a CMake based build.\u003Cbr>Please check the\n[CMake build instructions](cmake\u002FREADME.md).\n\n### Build from source using Bazel\n\nWe provide a Bazel based build.\u003Cbr>Please check the\n[Bazel build instructions](bazel\u002FREADME.md).\n\n## Quick Start\n\nThe best way to learn how to use OR-Tools is to follow the tutorials in our\ndeveloper guide:\n\nhttps:\u002F\u002Fdevelopers.google.com\u002Foptimization\u002Fintroduction\u002Fget_started\n\nIf you want to learn from code examples, take a look at the examples in the\n[examples](examples) directory.\n\n## Documentation\n\nThe complete documentation for OR-Tools is available at:\nhttps:\u002F\u002Fdevelopers.google.com\u002Foptimization\u002F\n\n## Contributing\n\nThe [CONTRIBUTING.md](CONTRIBUTING.md) file contains instructions on how to\nsubmit the Contributor License Agreement before sending any pull requests (PRs).\nOf course, if you're new to the project, it's usually best to discuss any\nproposals and reach consensus before sending your first PR.\n\n## License\n\nThe OR-Tools software suite is licensed under the terms of the Apache License 2.0.\n\u003Cbr>See [LICENSE](LICENSE) for more information.\n","OR-Tools 是 Google 开源的一款组合优化问题求解工具包。它提供了多种核心功能，包括约束编程求解器（CP 和 CP-SAT）、线性规划求解器（Glop 和 PDLP），以及混合整数规划求解器的封装接口；还包含了装箱和背包算法、旅行商问题及车辆路径问题的算法，以及图算法如最短路径、最小费用流等。该工具包以 C++ 为主要开发语言，并为 Python、C# 和 Java 提供了接口支持。适用于需要进行资源调度、路径规划、物流配送等场景下的复杂优化问题解决。",2,"2026-06-11 03:53:19","trending"]