Hello

I need a procedure to unjumble a series of 9 letters into discernable 4 to 9 letter words. each letter can only be used once and it needs to include a given letter in each word. eg IOCMRELAE, and include R in each word

Acer did a similar thing a while back, but in this case it needs to tell it to permute 9 letters, then 8,....,then 4 (each including letter R).

 >with(StringTools): with(PatternDictionary):
>bid:= Create(`builtin`):

Postage_Stamp_proble.mw

Hi

I have a program which I need to exit a loop when an error is thrown. it should then output the value of a. but it doesn't....

raw_panel_cuttin.doc

 Given a large rectangular wooden panel, you want to cut specific quantities of smaller rectangles from it.

to find the maximum number of rectan_gles that can be ortho_gonall_y packed into a lar_ger rectan_gle:

http://lagrange.ime.usp.br/~lobato/packing/run/index.php

1) can some maple code replicate this?

2) but what i really want is: what arrangement of a given a number of rectangles (of differing widths and lengths...

This is in a similar vein to the Diet problem (integer programming), but harder.

http://en.wikipedia.org/wiki/Cutting_stock_problem

This guy has solved this problem using 3 programs, Maxima and LPsolveIDE and Excel:

https://docs.google.com/View?docid=dfkkh8qj_64rrpz86db

A text file generated by maxima is fed into LPSolveIDE ...