Title of article
Faster MIPsolutionsvianewnodeselectionrules
Author/Authors
Daniel T.Wojtaszek، نويسنده , , JohnW.Chinneck ، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
13
From page
1544
To page
1556
Abstract
When abranchandboundmethodisusedtosolvealinearmixedintegerprogram(MIP),theorderin
which thenodesofthebranchandboundtreeareexploredsignificantlyaffectshowquicklytheMIPis
solved.Inthispaper,newmethodsarepresentedthatexploitcorrelationanddistribution
characteristicsofbranchandboundtreestotriggerbacktrackingandtochoosethenextnodeto
solvewhenbacktracking.Anewmethodisalsopresentedthatdetermineswhenthecostofusinga
node selectionmethodoutweighsitsbenefit,inwhichcaseitisabandonedinfavorofasimpler
method.Empiricalexperimentsshowthattheseproposedmethodsoutperformthecurrentstateofthe
art.
Keywords
Branch and Bound , Mixed-integer programming , Node selection rules
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927763
Link To Document