<?xml version="1.0" encoding="ISO-8859-1"?>

<!DOCTYPE message PUBLIC
  "-//MLarc//DTD MLarc output files//EN"
  "../../mlarc.dtd"[
  <!ATTLIST message
    listname CDATA #REQUIRED
    title CDATA #REQUIRED
  >
]>

  <?xml-stylesheet href="../../mlarc.xsl" type="text/xsl"?>


<message 
  url="2003/10/4058c99d956d6ca66e02a156165759eb"
  from="Christoph Bauer &lt;c_bauer@i...&gt;"
  author="Christoph Bauer"
  date="2003-10-02T20:16:13"
  subject="Re: [Caml-list] linear programming library in OCaml"
  prev="2003/10/18735eb0c0cd458e4ea45939dac80133"
  next="2003/10/87358a181b851561e5f4b8e96f06a292"
  prev-in-thread="2003/10/18735eb0c0cd458e4ea45939dac80133"
  prev-thread="2003/10/9a4a4be0cfe7c019ae4f42aaf4c47b30"
  next-thread="2003/10/87358a181b851561e5f4b8e96f06a292"
  root="../../"
  period="month"
  listname="caml-list"
  title="Archives of the Caml mailing list">

<thread subject="[Caml-list] linear programming library in OCaml">
<msg 
  url="2003/10/f3d9c4c952226ae84420081ffb0d0799"
  from="jrouquie@e..."
  author="jrouquie@e..."
  date="2003-10-02T17:38:09"
  subject="[Caml-list] linear programming library in OCaml">
<msg 
  url="2003/10/18735eb0c0cd458e4ea45939dac80133"
  from="James Scott &lt;j.scott@r...&gt;"
  author="James Scott"
  date="2003-10-02T19:11:12"
  subject="RE: [Caml-list] linear programming library in OCaml">
<msg 
  url="2003/10/4058c99d956d6ca66e02a156165759eb"
  from="Christoph Bauer &lt;c_bauer@i...&gt;"
  author="Christoph Bauer"
  date="2003-10-02T20:16:13"
  subject="Re: [Caml-list] linear programming library in OCaml">
</msg>
</msg>
</msg>
</thread>

<contents>
"James Scott" &lt;j.scott@runbox.com&gt; writes:

&gt; We were working on bindings from OCaml to COIN a few months ago, this
&gt; gives you access to a fairly serious (and 'free') simplex optimizer as
&gt; well as drivers for commercial codes. We were considering GPLing it but
&gt; have dropped that ball for the moment. But let us know if you're
&gt; interested. 
&gt;
&gt; Also we had something that resembles an algebraic modelling language
&gt; that makes it very easy to put an LP together, it all needs some work
&gt; for general use though...
&gt;
&gt; Alternatively you might consider interfacing the GNU Linear Programming
&gt; Toolkit.


IBGS uses a glpk-wrapper. Work was done by Tobias Wahl.  Look in the cvs

http://sf.net/projects/chesslib

under

  ibgs/lib/glpk


Christoph


-- 
proc self {} {foreach c [split [info body self] ""] d {14 -7 0 0 4 -67 4 73 11
69 24 -83 -15 6 -4 -84 78 20 11 -78 -1 -1 79 19 -8 4} { binary scan $c c c
if {[catch {append r [format %c [expr $c+$d]]}]} {return $r};}};puts [self]

-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners

</contents>

</message>

