Hi All,
this is probably a very silly question, but combinatorial math is
not exactly my strength and I am not even sure on how to formulate the
question. I apologize if it is a very elementary problem.
Let's suppose that I have 60 oil wells and 3 surface facilities. Every
well must be tied-in
On Mon, Oct 20, 2008 at 2:20 AM, A. G. wrote:
> one well attached to 2 or more units). Is there any simple way in
> numpy (scipy?) in which I can get the number of possible combinations
> of wells attached to the different 3 units, without repetitions? For
> example, I could have all 60 wells attac
On 10/20/2008 5:20 AM Andrea Gavana apparently wrote:
> this is probably a very silly question, but combinatorial math is
> not exactly my strength and I am not even sure on how to formulate the
> question. I apologize if it is a very elementary problem.
> Let's suppose that I have 60 oil wells
Hi All,
On Mon, Oct 20, 2008 at 12:48 PM, Alan G Isaac wrote:
> On 10/20/2008 5:20 AM Andrea Gavana apparently wrote:
>> this is probably a very silly question, but combinatorial math is
>> not exactly my strength and I am not even sure on how to formulate the
>> question. I apologize if it is
On Oct 20, 11:02 am, "Andrea Gavana" <[EMAIL PROTECTED]> wrote:
> Hi All,
>
>
>
> On Mon, Oct 20, 2008 at 12:48 PM, Alan G Isaac wrote:
> > On 10/20/2008 5:20 AM Andrea Gavana apparently wrote:
> >> this is probably a very silly question, but combinatorial math is
> >> not exactly my strength
