Asteroid has been merged with Scampi, to give rise to OScar.
Follow us on https://bitbucket.org/oscarlib/oscar/wiki/Home
Asteroid offers a powerful framework for developing constraint-based local search solution to combinatorial problems. This technique provides good scalability to real-world problems. It includes a library of standard constraints and invariants to declaratively define the problem you want to solve, and it also provides powerful search mechanisms.
Features
- Contraint-based local search framework
- Partial propagation of updates for fast neightbor exploration
- Static dependency graph can be cyclic
- Invariant library
- Constraint Library
- JobShop Scheduling
- Supported types are IntVar and IntSetVar
License
GNU Library or Lesser General Public License version 2.0 (LGPLv2), GNU Library or Lesser General Public License version 3.0 (LGPLv3)Follow Asteroid
Other Useful Business Software
AI-powered service management for IT and enterprise teams
Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
Rate This Project
Login To Rate This Project
User Reviews
-
Asteroid fills a hole that has been there for several years, namely an open-source and easy-to-use constraint-based local search framework. This is very much appreciated. Keep up the good work on this!
-
Very promising framework