We address methods for selecting the branching variable in an enumerative algorithm for Mixed-Integer Programs, providing heuristics to speed-up strong branching computation and to reduce the set of variables candidate for branching. Extensive computational results on instances from the literature show that, even in our proof-of-concept implementation, a certain speedup can be achieved with respect to state-of-the-art branching strategies.
Branching on nonchimerical fractionalities / M. Fischetti; M. Monaci. - In: OPERATIONS RESEARCH LETTERS. - ISSN 0167-6377. - STAMPA. - 40:(2012), pp. 159-164. [10.1016/j.orl.2012.01.008]
Branching on nonchimerical fractionalities
MONACI, MICHELE
2012
Abstract
We address methods for selecting the branching variable in an enumerative algorithm for Mixed-Integer Programs, providing heuristics to speed-up strong branching computation and to reduce the set of variables candidate for branching. Extensive computational results on instances from the literature show that, even in our proof-of-concept implementation, a certain speedup can be achieved with respect to state-of-the-art branching strategies.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
