https://doi.org/10.2307/3009435 • https://www.jstor.org/stable/3009435 Copy URL Commercial branch and bound codes for solving the general mixed integer linear ...
The problem of applying Generalized Lagrange Multipliers (GLM) to 0-1 integer programming problems is investigated. It is shown that GLM can produce optimal solutions if and only if these solutions ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback