PDF-On the Complexity of Selecting Disjunctions in Integer
Such disjunctions can be used for branching at each iteration of the branchandbound algorithm or to generate split i nequalities for the cuttingplane algorithm We
Download Presentation
Download Note : "On the Complexity of Selecting Disjunctions in Integer" is the property of its rightful owner. Permission is granted to download and print materials on this website for personal, non-commercial use only, provided you retain all copyright notices. By downloading content from our website, you accept the terms of this agreement.
Presentation Transcript
Transcript not available.