Open Optimization Library Files

Status: Alpha

Brought to you by: akiles, biloti

The interactive file manager requires Javascript. Please enable it or use sftp or scp.
You may still browse the files here.

Name	Modified	InfoDownloads / Week
Parent folder
ool-examples-0.1.0	2004-08-05	0
Totals: 1 Item		0

Other Useful Business Software

Ship Agents Faster

Transform your applications and workflows into powerful agentic systems at global scale.

Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.

Start Free

Build Securely on AWS with Proven Frameworks

Lay a foundation for success with Tested Reference Architectures developed by Fortinet’s experts. Learn more in this white paper.

Moving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.

Download Now

Ship Agents Faster

Transform your applications and workflows into powerful agentic systems at global scale.

Start Free

Recommended Projects

pygsl python interface for GNU scientifi
A Python interface to the GSL library. The wrapper covers nearly everything GSL provides.
NOMAD: blackbox optimization software
NOMAD is a C++ code that implements the MADS algorithm (Mesh Adaptive Direct Search) for difficult blackbox optimization problems. Such problems occur when the functions to optimize are costly computer simulations with no derivatives.
libfgen
Library for optimization using a genetic algorithm or particle swarms
OR-Tools - Google Optimization Tools
Google's software suite for combinatorial optimization
Condorcet with Dual Dropping
Preference (or approval) ballot tabulation to select winner(s) of election contests or rank decisions. Uses dropping cost minimization to combine two Condorcet methods: Cloneproof Schwartz Sequential Dropping and Tideman's Ranked Pairs.