Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help | Search |
Name: google-or-tools | Distribution: openSUSE Tumbleweed |
Version: 9.6 | Vendor: openSUSE |
Release: 3.7 | Build date: Sat Feb 3 01:12:16 2024 |
Group: Development/Languages/C++ | Build host: h02-ch1d |
Size: 2920992 | Source RPM: google-or-tools-9.6-3.7.src.rpm |
Packager: http://bugs.opensuse.org | |
Url: https://developers.google.com/optimization/ | |
Summary: Suite for solving combinatorial optimization problems |
OR-Tools is an open source software suite for optimization, tuned for tackling the world's toughest problems in vehicle routing, flows, integer and linear programming, and constraint programming.
Apache-2.0
* Tue Aug 08 2023 Stefan Brüns <stefan.bruens@rwth-aachen.de> - Fix build with re2 2023-07-01, add 0001-deps-bump-re2-to-2023-07-01.patch - Cleanup skipped tests * Sun Jul 09 2023 Stefan Brüns <stefan.bruens@rwth-aachen.de> - Fix build with latest protobuf, add 0001-base-Remove-AbslStringify.patch * Thu May 11 2023 Stefan Brüns <stefan.bruens@rwth-aachen.de> - Update to version 9.6: * Dependencies + SCIP v801 -> v803 (note: now uses an OSI compatible license) + abseil 20220623.1 -> 20230105.0 + Protobuf v21.5 -> v21.12 + SWIG 4.1.1 * PDLP + Add python wrapper. * CP-SAT + Performance improvements. * GLOP + Tweak presolve. * ModelBuilder + Python: Improve numpy support. * Bazel + Add pybind11 support. + Add java wrapper support. * Routing + Few improvements (local search) * Known Issues: + CP-SAT: Ignoring pseudo_costs subsolver returns Invalid parameters. (#3706) - Update to version 9.5: * CP-SAT + Presolve improvements: max(array), Boolean constraints, linear constraints. + Interleaved search should be deterministic in parallel. + Linear cuts: cleanup square and int_prod cuts; rewrite cut pipeline. + Fingerprint input model and solution (visible in the log). + Scheduling improvements + The usual bunch of bugfixes (crash during presolve, crash in cuts, infeasible solutions, model infeasible in LNS). * GLOP + Speedup by rewriting the linear algebra, as well as the pivot selection rule * Linear Solver + add knapsack_interface.cc. + Move model_builder API under the linear_solver directory (headers and samples). + Add support for Gurobi 10. * Routing + Liberate few parser for various routing challenge. - Drop obsolete patches: * do_not_call_pdlp_solve_test.patch * 0003-Reuse-common-add_cxx_example-function-for-Sat-Runner.patch - Update patches: * 0001-Only-add-relevant-directories-to-sample-RUNPATHs.patch * 0002-Only-add-relevant-directories-to-flatzinc-library-ex.patch * 0003-Only-add-relevant-directories-to-sat_solver-RUNPATHs.patch - Use PIP_NO_INDEX instead of 0001-Do-not-try-to-download-ortools-wheel.patch * Fri Nov 25 2022 Stefan Brüns <stefan.bruens@rwth-aachen.de> - Fix build with SWIG 4.1 * Sat Sep 17 2022 Stefan Brüns <stefan.bruens@rwth-aachen.de> - Update to version 9.4: * Graph + Split ortools.graph.pywrapgraph into: - ortools.graph.python.linear_sum_assignment - ortools.graph.python.max_flow - ortools.graph.python.min_cost_flow This allows using numpy to speed up the setup of the problems. * CP-SAT + Some improvement on: - scheduling (propagation, cuts, lower bounds) - MaxSAT (presolve, core based heuristics) - MIP performance (presolve, cuts) - Drop upstream patches: * fix_re2_string_view.patch * 0001-Build-Python-modules-as-CMake-MODULEs.patch * fix_malformed_Cpp.patch * 0001-Set-SWIGWORDSIZE-dependent-on-architecture-bitness.patch - Add patches: * do_not_call_pdlp_solve_test.patch * 0003-Reuse-common-add_cxx_example-function-for-Sat-Runner.patch * Fri Jul 15 2022 Stefan Brüns <stefan.bruens@rwth-aachen.de> - Fix failing builds due to stricter RUNPATH checks, add * 0001-Only-add-relevant-directories-to-sample-RUNPATHs.patch * 0002-Only-add-relevant-directories-to-flatzinc-library-ex.patch * Sun May 29 2022 Stefan Brüns <stefan.bruens@rwth-aachen.de> - Fix failing build with GCC 12, add fix_malformed_Cpp.patch - Fix build on 32bit archs, allow tests to fail - Add _constraints to avoid no-space-left errors * Sun Apr 24 2022 Stefan Brüns <stefan.bruens@rwth-aachen.de> - Initial package version (9.3) - Add fix_re2_string_view.patch - Add 0001-Build-Python-modules-as-CMake-MODULEs.patch
/usr/bin/assignment_groups_mip /usr/bin/assignment_groups_sat /usr/bin/assignment_linear_sum_assignment /usr/bin/assignment_min_flow /usr/bin/assignment_mip /usr/bin/assignment_sat /usr/bin/assignment_task_sizes_mip /usr/bin/assignment_task_sizes_sat /usr/bin/assignment_teams_mip /usr/bin/assignment_teams_sat /usr/bin/assumptions_sample_sat /usr/bin/balance_min_flow /usr/bin/basic_example /usr/bin/bin_packing_mip /usr/bin/binpacking_problem_sat /usr/bin/bool_or_sample_sat /usr/bin/channeling_sample_sat /usr/bin/constraint_programming_cp /usr/bin/copy_model_sample_sat /usr/bin/costas_array_sat /usr/bin/cp_is_fun_cp /usr/bin/cp_is_fun_sat /usr/bin/cp_sat_example /usr/bin/cryptarithm_sat /usr/bin/cvrp_disjoint_tw /usr/bin/cvrptw /usr/bin/cvrptw_with_resources /usr/bin/cvrptw_with_stop_times_and_resources /usr/bin/earliness_tardiness_cost_sample_sat /usr/bin/flow_api /usr/bin/golomb_sat /usr/bin/integer_programming /usr/bin/integer_programming_example /usr/bin/interval_sample_sat /usr/bin/knapsack /usr/bin/linear_assignment_api /usr/bin/linear_programming /usr/bin/linear_programming_example /usr/bin/linear_solver_protocol_buffers /usr/bin/literal_sample_sat /usr/bin/magic_sequence_sat /usr/bin/magic_square_sat /usr/bin/max_flow /usr/bin/min_cost_flow /usr/bin/minimal_jobshop_cp /usr/bin/minimal_jobshop_sat /usr/bin/mip_var_array /usr/bin/multiple_knapsack_mip /usr/bin/multiple_knapsack_sat /usr/bin/no_overlap_sample_sat /usr/bin/non_linear_sat /usr/bin/nqueens /usr/bin/nqueens_cp /usr/bin/nqueens_sat /usr/bin/nurses_cp /usr/bin/nurses_sat /usr/bin/optional_interval_sample_sat /usr/bin/qap_sat /usr/bin/rabbits_and_pheasants_cp /usr/bin/rabbits_and_pheasants_sat /usr/bin/random_tsp /usr/bin/ranking_sample_sat /usr/bin/reified_sample_sat /usr/bin/sat_runner /usr/bin/schedule_requests_sat /usr/bin/search_for_all_solutions_sample_sat /usr/bin/simple_cp_program /usr/bin/simple_glop_program /usr/bin/simple_knapsack_program /usr/bin/simple_lp_program /usr/bin/simple_ls_program /usr/bin/simple_max_flow_program /usr/bin/simple_min_cost_flow_program /usr/bin/simple_mip_program /usr/bin/simple_pdlp_program /usr/bin/simple_routing_program /usr/bin/simple_sat_program /usr/bin/slitherlink_sat /usr/bin/solution_hinting_sample_sat /usr/bin/solve /usr/bin/solve_and_print_intermediate_solutions_sample_sat /usr/bin/solve_with_time_limit_sample_sat /usr/bin/step_function_sample_sat /usr/bin/stigler_diet /usr/bin/stop_after_n_solutions_sample_sat /usr/bin/tsp /usr/bin/tsp_circuit_board /usr/bin/tsp_cities /usr/bin/tsp_cities_routes /usr/bin/tsp_distance_matrix /usr/bin/uncapacitated_facility_location /usr/bin/variable_intervals_sat /usr/bin/vrp /usr/bin/vrp_breaks /usr/bin/vrp_capacity /usr/bin/vrp_drop_nodes /usr/bin/vrp_global_span /usr/bin/vrp_initial_routes /usr/bin/vrp_pickup_delivery /usr/bin/vrp_pickup_delivery_fifo /usr/bin/vrp_pickup_delivery_lifo /usr/bin/vrp_resources /usr/bin/vrp_routes /usr/bin/vrp_solution_callback /usr/bin/vrp_starts_ends /usr/bin/vrp_time_windows /usr/bin/vrp_with_time_limit /usr/bin/vrptw_store_solution_data /usr/share/doc/packages/google-or-tools /usr/share/doc/packages/google-or-tools/CONTRIBUTING.md /usr/share/doc/packages/google-or-tools/README.md /usr/share/doc/packages/google-or-tools/constraint_solver /usr/share/doc/packages/google-or-tools/constraint_solver/CP.md /usr/share/doc/packages/google-or-tools/constraint_solver/PDP.md /usr/share/doc/packages/google-or-tools/constraint_solver/README.md /usr/share/doc/packages/google-or-tools/constraint_solver/ROUTING.md /usr/share/doc/packages/google-or-tools/constraint_solver/TSP.md /usr/share/doc/packages/google-or-tools/constraint_solver/VRP.md /usr/share/doc/packages/google-or-tools/sat /usr/share/doc/packages/google-or-tools/sat/README.md /usr/share/doc/packages/google-or-tools/sat/boolean_logic.md /usr/share/doc/packages/google-or-tools/sat/channeling.md /usr/share/doc/packages/google-or-tools/sat/integer_arithmetic.md /usr/share/doc/packages/google-or-tools/sat/model.md /usr/share/doc/packages/google-or-tools/sat/scheduling.md /usr/share/doc/packages/google-or-tools/sat/solver.md /usr/share/licenses/google-or-tools /usr/share/licenses/google-or-tools/LICENSE
Generated by rpm2html 1.8.1
Fabrice Bellet, Tue Apr 9 21:38:35 2024