Hi, I wrote a program to solve cutting stock problem. Program is written in C++ and uses GLPK C API. Customized branch & bound (BB) algorithm is used. Each node of BB tree is a LP. Each node LP is solved using column generation (CG). Very simple branching on fractional variable is used to obtain integer solution. BB tree is traversed using breadth first search (BFS) strategy.
Hopefully program will be useful to anyone interested in learning GLPK C API and understand column generation technique. In case you want to have a look at the source code, following web-page has more details, including source code: http://code.google.com/p/cspsol/ I have not tested the program extensively. It is likely that program has some flaw or incorrect use of GLPK C API. Your feedback/comments are welcome. Thanks -- Vijay Patil _______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
