| COOOL |
Update Link / Bad Link? |
The CWP Object-Oriented Optimization Library (COOOL) consists of a collection of C++ classes (encapsulations of abstract ideas), a variety of optimization algorithms implemented using these classes, and a collection of test functions, which can be used to evaluate new optimization algorithms.
Submitted: Nov 14, 1999
Rating: 0.00 Rate this linkTotal Visits: 419
|
| CPLEX Callable Library |
Update Link / Bad Link? |
The CPLEX Callable Library is a powerful optimization library system created specifically for those with development or specialized application requirements. It allows you to integrate high-performance CPLEX algorithms directly into your own applications, quickly and efficiently. The unique capability to populate, query and manipulate the CPLEX database directly eliminates clumsy, time-consuming file reading and writing, empowering you to create lightning fast, compact applications.
Submitted: Dec 06, 1999
Rating: 0.00 Rate this linkTotal Visits: 376
|
| LINDO Systems |
Update Link / Bad Link? |
Optimization modeling tools for linear, nonlinear and integer programming.
Submitted: Dec 19, 1996
Rating: 0.00 Rate this linkTotal Visits: 295
|
| Optimization Software for C/C++ Developers |
Update Link / Bad Link? |
Looking for powerful optimization software with full support for C/C++? For 15 years, developers have relied on Frontline Systems Solvers in "callable library" form. From departmental applications with a few users to high volume commercial products with hundreds of thousands or millions of users (as in Mathcad and Microsoft Excel), Frontline Solvers have been proven in use.
Submitted: Oct 16, 1998
Rating: 0.00 Rate this linkTotal Visits: 246
|
| GLPK (GNU Linear Programming Kit) |
Update Link / Bad Link? |
The GLPK (GNU Linear Programming Kit) package is intended for solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems. It is a set of routines written in ANSI C and organized in the form of a callable library.
Submitted: May 24, 2005
Rating: 0.00 Rate this linkTotal Visits: 186
|
| Web-based Tool for Solving Practical Optimization Problems |
Update Link / Bad Link? |
Optimized function can contain breaks of the 1st type. Restriction System can contain both conditions of equalities type and of inequalities type. Theoretical base of algorithm is a combination of methods of local extremum searching and of global optimization searching. As a method of local extremum searching, the quasi-Newton processes with different methods of univariate searching are used.
Submitted: Aug 11, 2003
Rating: 0.00 Rate this linkTotal Visits: 173
|
| GIPALS32 - Linear Programming Library |
Update Link / Bad Link? |
Linear programming library that incorporates the power of linear programming solver and simplicity of integration to any software tools like Ms Visual C++, Ms Visual Basic, Borland Delphi and other that support a DLL import. The maximum number of constraints and variables is UNLIMITED.
Submitted: Nov 10, 2005
Rating: 0.00 Rate this linkTotal Visits: 133
|
| Open Discrete Dynamic Programming Template |
Update Link / Bad Link? |
OpenDiscreteDinamicProgrammingTemplate : founds optimal constrainted parameters of a discrete controls with second order optimization template replacing Hessian with directional derivatives and backpropagation for digital filter(as neural network).
Submitted: Sep 17, 2005
Rating: 0.00 Rate this linkTotal Visits: 105
|
| StarFLIP++ |
Update Link / Bad Link? |
StarFLIP++ is a reusable iterative optimization library for combinatorial problems with fuzzy constraints. The StarFLIP++ family of C++ libraries focuses on reusability and applicability for a wide range of combinatorial problems.
Submitted: Nov 14, 1999
Rating: 0.00 Rate this linkTotal Visits: 79
|
| Global and non-smooth optimization toolbox |
Update Link / Bad Link? |
GANSO is a programming library for global and nonsmooth, nonlinear continuous optimization. Matlab toolbox provides an interface for calling GANSO methods from Matlab.
Global optimization is a branch of mathematics dedicated to the search for parameters providing the best outcome under given constraints. Unlike local methods which converge to some local minimum, global methods aim at identifying the absolute minimum of a function.
Submitted: Nov 12, 2006
Rating: 0.00 Rate this linkTotal Visits: 46
|
| PrioritizeThis(tm) Software, Inc. |
Update Link / Bad Link? |
PrioritizeThis(tm) v.1.1 for Windows is a simple and efficient program to prioritize and allocate tasks, time and money in less than 7 minutes.
Submitted: Aug 11, 2003
Rating: 0.00 Rate this linkTotal Visits: 30
|
| TOMNET |
Update Link / Bad Link? |
The TOMNET Optimization Platform provides a standardized environment for general operations research development for the Microsoft .NET Framework. Well-known optimization solvers, such as SNOPT and MINOS are fully integrated.
Submitted: Feb 05, 2007
Rating: 0.00 Rate this linkTotal Visits: 17
|
| Terms of Use: |
|
| NOTICE: Links you submit to Mathtools.net Link Exchange will
be accessible from any part of the world via the web. Any information such
links contain may be used by The MathWorks and the public, both within
and outside the country from which you posted. Read
complete disclaimer prior to use. |