[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Help-glpk] GLPK Branch and Bound Documentation
From: |
Marc-Antoine Leroux |
Subject: |
[Help-glpk] GLPK Branch and Bound Documentation |
Date: |
Tue, 27 Sep 2005 09:49:51 +0200 |
Hi,
With the GLPK package I have received very good documentation on the
Implementation of the Revised Simplex Method.
Is it possible to receive the same kind of documentation on the
implementation of the branch-and-bound method?
For exemple I try to understand how the algorithm stop. Does is stop
when we have find the optimal solution, or after x iterations, or if
we are at x% of the optimal solution???
Thanks in advance.
Marc-Antoine
[Prev in Thread] |
Current Thread |
[Next in Thread] |
- [Help-glpk] GLPK Branch and Bound Documentation,
Marc-Antoine Leroux <=