Search:
MATLAB Central
File Exchange
Answers
Newsgroup
Link Exchange
Blogs
Trendy
Cody
Contest
MathWorks.com
Create Account
Log In
File Exchange
Answers
Newsgroup
Link Exchange
Blogs
Trendy
Cody
Contest
MathWorks.com
Files
Authors
Tags
Comments
My File Exchange
Submit a File
About File Exchange
Rank: 123779
based on
0 downloads (last 30 days)
and
0 file submitted
Mojeeb
Email
Contact Author
Personal Profile:
Professional Interests:
Watch this Author's files
Files
Watch Lists
Comments and Ratings by Mojeeb
View all
1  2 of
2
Updated
File
Comments
Rating
04 May 2013
Hungarian Algorithm
An algorithm to find the minimum edge weight matching for an arbitrary bipartite graph.
Author:
Alexander Melin
nice
12 Dec 2011
Traveling Salesman Problem  Genetic Algorithm
Finds a nearoptimal solution to a TSP using a GA
Author:
Joseph Kirk
thanks!
Currently Watching
Type
Description
File
Hungarian Algorithm
File
Simple Example of Simulated Annealing Optimization
Files Matching Mojeeb's Watch List
View all
1  2 of
2
Updated
File
Tags
Downloads
(last 30 days)
Comments
Rating
18 Mar 2011
Simple Example of Simulated Annealing Optimization
Example of developing a hybrid solution (Simulated Annealing + Pattern Search) for a case of study.
Author:
Francesco Pizzo
optimization
,
simulated annealing
,
smes
,
pattern search
,
minimum
36
0
5.0
5.0

1 rating
08 Aug 2006
Hungarian Algorithm
An algorithm to find the minimum edge weight matching for an arbitrary bipartite graph.
Author:
Alexander Melin
optimization
,
minimum
,
maximum
,
weight
,
matching
161
19
4.11765
4.1

17 ratings
Comments and Ratings Matching Mojeeb's Watch List
15 of
21
Date
File
Comment by
Comments
Rating
02 May 2014
Simple Example of Simulated Annealing Optimization
Example of developing a hybrid solution (Simulated Annealing + Pattern Search) for a case of study.
PARAG
5
07 Mar 2014
Hungarian Algorithm
An algorithm to find the minimum edge weight matching for an arbitrary bipartite graph.
Shawn Lu
5
04 May 2013
Hungarian Algorithm
An algorithm to find the minimum edge weight matching for an arbitrary bipartite graph.
Mojeeb
nice
Comment only
18 Apr 2013
Hungarian Algorithm
An algorithm to find the minimum edge weight matching for an arbitrary bipartite graph.
Alvaro Bertelsen
Very good work.
5
03 Oct 2012
Hungarian Algorithm
An algorithm to find the minimum edge weight matching for an arbitrary bipartite graph.
sixie yu
This function can effectively calculate NxN matrices, and can also process NxM matrices. But it is a little difficult to understand the source code. Maybe my abilities matter. In sum, it is useful.
4
Contact us
Comment only