|
From: | RC Loh |
Subject: | Re: [Help-glpk] Linear Programming Relaxation |
Date: | Fri, 27 Nov 2009 12:36:41 +0800 (SGT) |
2) Using the Linear Programming Relaxation (LPR) method to obtain an approximate algorithm does not mean that the approximation is for the objective function, is that right? Because we cannot guarantee how close we are to the optimal result using the LPR, is that right? Using the LPR method is more like a heuristics algorithm, is that right?
3) How do I cite GLPK for a paper conference submission?
Thank you.
Rdgs,
Paul
BinaryLinearProgramming_LP_file.txt
Description: Text document
LinearProgramRelaxed_LP_file.txt
Description: Text document
Output_BinaryLinearProgram.txt
Description: Text document
Output_LinearProgramRelaxed.txt
Description: Text document
[Prev in Thread] | Current Thread | [Next in Thread] |