Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
Excel .Net Library 2020.6
fsMediaLibrary.NET 2019.11
VaxVoIP SIP Server SDK 5.2.0
Database Workbench Pro 5.7.4
dbForge Data Generator for Oracle 2.2
dbExpress driver for SQL Server 8.2
Grobino Online Grocery Shopping 1.1
PortalNest: Dynamics CRM Customer Portal 1.0
Purbis: JustEat Clone Scripts 1.1
Monoline MLM Software 1.3.4
Cab Booking Android Application by iNet Mobile 1.4
Shopping Cart Script by i-Netsolution 1.3.4
PortalNest: SuiteCRM Customer Portal 1.0
SugarCRM WordPress Customer Portal 3.2.0
The C# PDF Library 2020.6.0
Top Code
phpEnter 5.1.
Single Leg MLM 1.2.1
Azizi search engine script PHP 4.1.10
Paste phpSoftPro 1.4.1
Extreme Injector 3.7
Deals and Discounts Website Script 1.0.2
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
Invoice Manager by PHPJabbers 3.0
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Availability Booking Calendar PHP 1.0
Related Code
Branch And Bound Algorithmjava
Tsp Using Branch Bound
How To Bound Data With Asptable Control In Aspnet
Bound Dropdown
Vbnet Control Datagrid Bound Column
Grid Bound
Branch And Bound Skyline
Branch And Bound Visual Basic
Format Bound Data Column Aspnet
Branch And Bound Source Code
Brunch And Bound
Branch And Bound Vba
Branch And Bound Tsp Vba
Breach And Bound
Grid Bound At Run Time Aspnet
Bound
All | Freeware

Code 1-20 of 34   Pages: Go to  1  2  Next >>  page  






Ok, yes, my expectation was that when I saw this, before I downloaded it I expected it to be a student's homework assigment. In fact, this is a reasonably carefully crafted tool.

One serious issue is that this code requires you to provide explicit functional forms for the gradient and Hessian. There is a finite difference capability in the code, but it apparently does not run unless you provide at least a functional gradient or a...



New users and old of optimization in MATLAB will find useful tips and tricks in this document, as well as examples one can use as templates for their own problems.

Use this tool by editing the file optimtips.m, then execute blocks of...



rand_extended computes a random number in the interval [a,b]
It is basically an extended version of the command rand
Inputs:
a: the lower bound of the interval
b: the upper bound of the interval
m,n(optional):...



0.3.4 Cleaned up some code, now hosted on github/mpAjax.

0.3.2 Fixed a bug where jQuery automagically translating the 'data' parameter to an object (XMLDOM) would throw a JS error.

0.3.1 Fixed a bug where not specifying a...



Globalmin is a very simple m-code which implements the very efficient Brent's algorithm.
It looks like fminbnd without any options and finds with a guaranteed precision a global minimum of a function under bounds constraints.
This goal...



We present a set of functions based on interval arithmetic to solve small size global optimization problems with guaranteed bounds on solutions. Interval analysis can be used to bound ALL solutions of nonlinear optimization problem, equality...



Simulated annealing is an optimization algorithm that skips local minimun. It uses a variation of Metropolis algorithm to perform the search of the minimun. It is recomendable to use it before another minimun search algorithm to track the global...



I need to thank Duane Hanselman for suggesting this great idea.

Fminspleas is a simple nonlinear least squares tool that fits regression models of the form

Y = a1*f1(X,C) + a2*f2(X,C) + ... + an*fn(X,C)

X can be...



The searching process is necessary for the Affinity propagation clustering (AP) when one demands a clustering solution under given number of clusters.
The Fast AP uses multi-grid searching to reduce the calling times of AP, and improves the...



This powerful plugin allows you to create your own query of posts and pages and displays the result wherever you like it on a page only by adding a shortcode to the page. The great feature is, that you can use nearly all the capabilities of a...



Input parameters
p : odd prime number
deg: positive integer (default value = 1)

Output is a (p^deg+1) by (p^deg+1)/2 matrix E

When deg > 1, the communication toolbox is required

A collection of...



This function solves the mixed integer linear programming problems. It uses the linprog.m function that comes with the optimization toolbox of MATLAB. It employs the branch and bound algorithm. It uses depth first search



This project consists of a specification of how a client should communicate with the server to fetch it's updates. The server is scaled to support hosting of mulitple applications at the same time.

This tools allow to write website...



The code is an implementation of the newly developed bidirectional branch and bound algorithm for multiobjective input-output pairing selection as part of decentralised control design. Two criteria are used in this particular code: the...



Given an input primal gear, the toolbox compute its associated dual gear together with the associated distance between the gear centers.

The gears are described as a discretized polar curve. The dual gear is solved by a numerical...



Return a concatenation of multiple colon-intervals.

User provides left, step, and right bound.

>> mcolon([0 10],[1 2],[2 14])

ans = 0 1 2 10 12 14



It is desired for modern process systems to achieve optimal operation. However, operation at a pre-designed nominally optimal point may not necessarily be actually optimal due to realtime disturbances, measurement and control errors and...



This is an addon for the Outline module. It adds a dynamic menu which allows dynamic navigation through the book. This makes also big outlines navigatable.

Roadmap
I'm still waiting on the Outline module to be ported. Untill then...



find the shortest Euclidean path that is bounded
by the functions low(t) and high(t).

the algorithm is based on Dijkstra shortest path search algorithm

syntax:
[ty y] = shortest_path_mfile(t,low,high)
(See the...



L-BFGS-B is a collection of Fortran 77 routines for solving nonlinear optimization problems with bound constraints on the variables. One of the key features of the nonlinear solver is that the Hessian is not needed. I've designed an interface to...