v9.12
#4544
Replies: 2 comments
-
Thanks for this! I'm seeing a significant speedup for some of my CP-SAT problem sets. |
Beta Was this translation helpful? Give feedback.
0 replies
-
The specific application is a routing problem that uses the circuit constraints in CP-SAT. The problem is more like resource allocation, matching pickup and delivery of items with truck capacity, crew availability, driver availability, venue and warehouse operating hours, and so on. Too complicated for the routing solver. A known largish problem I use for testing takes about 85 seconds with 9.11, and about 56 seconds 9.12 to converge to optimal, on my laptop with 8 workers (8 threads cpu).
James
|
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
Platforms
Builds
Dependencies
C++
Graph
EbertGraph
,StarGraph
,ForwardEbertGraph
,ForwardStarGraph
) have been removed.Use
ReverseArcListGraph<>
andListGraph<>
instead. Those are conceptually similar, but typically perform better.APIs are mostly compatible.
CP-SAT
Linear Solver
WriteModelToMpsFile
toMPSolver
in Java, Python and .NETMath Opt
Model Builder
SCIP
Known Issues
Full Changelog: v9.11...v9.12
This discussion was created from the release v9.12.
Beta Was this translation helpful? Give feedback.
All reactions