Path: news.mathworks.com!not-for-mail
From: <HIDDEN>
Newsgroups: comp.soft-sys.matlab
Subject: Re: Optimizing a selection problem
Date: Sat, 9 Oct 2010 17:57:03 +0000 (UTC)
Organization: The MathWorks, Inc.
Lines: 8
Message-ID: <i8qadf$64o$1@fred.mathworks.com>
References: <i8p0oc$fbe$1@fred.mathworks.com>
Reply-To: <HIDDEN>
NNTP-Posting-Host: webapp-03-blr.mathworks.com
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
X-Trace: fred.mathworks.com 1286647023 6296 172.30.248.38 (9 Oct 2010 17:57:03 GMT)
X-Complaints-To: news@mathworks.com
NNTP-Posting-Date: Sat, 9 Oct 2010 17:57:03 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 1187260
Xref: news.mathworks.com comp.soft-sys.matlab:677124

"Jordan " <j333poppenk@removethethrees.princeton.edu> wrote in message <i8p0oc$fbe$1@fred.mathworks.com>...
> .......
> Can anyone point me towards an appropriate function or algorithm? 
> .......

  One more incomplete thought.  I think I see a correspondence between this problem and the famous (infamous) traveling salesman problem which is known to be NP-hard.  If that is so, you have posed a computational very difficult problem.  What exactly is your idea of a criterion for choosing between two different pairings among the sets - a least sum of squares of some sort?

Roger Stafford