Hello David, I have converted Andrews examle to Java using GLPK-Java. See appendix.
Best regards Xypron -------- Original-Nachricht -------- > Datum: Fri, 5 Mar 2010 16:47:58 +0300 > Von: "David Pérez" <[email protected]> > An: [email protected] > Betreff: [Help-glpk] Re: Looking for branch-and-cut sample code > Thanks, this example is perfect for us. Is the brach-and-cut API > completely supported by the java JNI interface? > > > > > Hi, we are trying to solve a bilevel problem with glpk. Our best > > aproach is to use a branch-and-cut method. We´ve seen that glpk have a > > specific API for this kind of problems is there any sample code?. > > > >You can look at an example application to solve the linear ordering > > >problem; see attachment to the following message: > > >http://lists.gnu.org/archive/html/help-glpk/2010-01/msg00117.html > > >Though that code demonstrates generating lazy constraints, cutting > > >planes can be generated in the same way; for more details please see > > >the reference manual included in the glpk distribution. -- Sicherer, schneller und einfacher. Die aktuellen Internet-Browser - jetzt kostenlos herunterladen! http://portal.gmx.net/de/go/atbrowser
LinOrd.java
Description: Binary data
_______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
