Parametric branch and bound
The paper describes a procedure for mixed integer programming that allows branches to be imposed 'by degrees', which can subsequently be revised or weeded out according to their relative influence. It is an adaptive approach in which the branch and bound tree can be manipulated and restructured. The approach also yields measures of the costs of imposing the branches that lead to integer solutions, thus providing a built-in form of sensitivity analysis for evaluating the effect of integer restrictions.
Volume (Year): 6 (1978)
Issue (Month): 2 ()
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:6:y:1978:i:2:p:145-152. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.