You might find these posts interesting. I've compiled Java interfaces
upto 4.20 with no problem.

1. [Help-glpk] Re: GLPK and Java using SWIG (score: 36)
      Date: Fri, 1 Jun 2007 11:46:00 +0100

      NigelzGLPK.swg is the file in the pdf document in the section "The
      SWIG Interface File". I've attached a copy. Also I've attached a
      bug report I made to make it work. You will probably need to make t

      /archive/html/help-glpk/2007-06/msg00000.html (5,085 bytes)

2. [Help-glpk] Bindings for GLPK (score: 4)
      Date: Thu, 31 May 2007 11:47:23 +0100

      SWIG is a software development tool that simplifies the task of
      interfacing different languages to C and C++ programs. In a
      nutshell, SWIG is a compiler that takes C declarations and creates
      the wrap

      /archive/html/help-glpk/2007-05/msg00076.html (4,494 bytes)

  ----- Original Message -----
  From: "Alessandra De Luca"
  To: "Oscar Gustafsson"
  Subject: Re: [Help-glpk] Execution time
  Date: Fri, 14 Sep 2007 11:53:07 +0200 (CEST)

  Thank you, but how can I download Glpk 4.9 java Interface? In web
  I've found only java interface for glpk 4.8.....

  Oscar Gustafsson <[EMAIL PROTECTED]> ha scritto:

    Alessandra,

    it is not an unreasonable long time for such a big problem. You
    can find
    problems with much fewer rows and columns that are practically
    impossible
    to solve using branch-and-bound.

    The MIP-solver got a big upgrade starting from version 4.9, so if
    you are
    using 4.8 you will most likely not use it (unless you are infact
    using a
    later GLPK but a 4.8-interface, however even then you will not be
    able to
    access lpx_intopt, which is the new solver).

    So, start by upgrading the GLPK-version and try the advanced
    MIP-solver as
    a first step.

    Good luck!

    /Oscar Gustafsson


    On Fri, 14 Sep 2007, Alessandra De Luca wrote:

    > I'm trying to solve a MIP problem with 17575 rows, 14960 column
    and 1018925 non-zeros but Glpk spend a lot of time to solve it
    (about 40 minutes)....it's normal or there is a way to solve the
    problem quickly by setting some parameters (for example I've
    realized that if I set the parameter lpx_k_branch to 0 the
    execution time for the same problem become larger than 12 hours)?
    > In this case what are the parameters I have to set to improve
    glpk solver and so to reduce the execution time?
    > (I'm using glpk from my java code by using Glpk 4.8 java
    interface).
    >
    > Thanks
    >
    >
    > ---------------------------------
    >
    > ---------------------------------
    > L'email della prossima generazione? Puoi averla con la nuova
    Yahoo! Mail


  --------------------------------------------------------------------

  --------------------------------------------------------------------

  L'email della prossima generazione? Puoi averla con la nuova Yahoo!
  Mail
  _______________________________________________
  Help-glpk mailing list
  [email protected]
  http://lists.gnu.org/mailman/listinfo/help-glpk

-- 
_______________________________________________
Surf the Web in a faster, safer and easier way:
Download Opera 9 at http://www.opera.com

Powered by Outblaze
_______________________________________________
Help-glpk mailing list
[email protected]
http://lists.gnu.org/mailman/listinfo/help-glpk

Reply via email to