On Thu, 23 Feb 2012, Joey Rios wrote:
Oh, I'm the author of dwsolver. My interest is in doing some computational tests on 'real' problems. Turns out it's hard (in the NP sense, I think) to decompose a given LP instance into the correct form for DW decomposition. It's much easier to generate the decomposition if you know the model you are using.
What do you mean by "the correct form"? Given any set of complicationg constraints, one can readily derive the minimal block structure of the rest. To make the problem hard, one would need some criterion other than correctness. -- Michael [email protected] "On Monday, I'm gonna have to tell my kindergarten class, whom I teach not to run with scissors, that my fiance ran me through with a broadsword." -- Lily _______________________________________________ Help-glpk mailing list [email protected] https://lists.gnu.org/mailman/listinfo/help-glpk
