Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.independent

Topic: optimal sorting
Replies: 3   Last Post: Dec 11, 2012 11:59 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Scott Berg

Posts: 1,438
Registered: 12/12/04
Re: optimal sorting
Posted: Dec 7, 2012 2:38 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply


"gsgs" <sterten@aol.com> wrote in message
news:c2a74aef-23b7-4a46-ba73-26926d10baea@googlegroups.com...
> given a (symmetrical) finite real square matrix d(n,n)
> find a permutation s in S_n such that
>
> SUM[i=2..n] ( min{d(s(i),s(j))|0<j<i} ) is minimal
>
> how is it called, how to solve it
>


what is s(i) ? or s(j) ? function, but what ?





Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.