A trust branching path heuristic for zero-one programming

D. Fortin and I. Tseveendorj

European Journal of Operational Research, 2009, vol. 197, issue 2, 439-445

Abstract: For 0-1 problems, we propose an exact Branch and Bound procedure where branching strategy is based on empirical distribution of each variable within three intervals [0,[epsilon]],[[epsilon],1-[epsilon]],[1-[epsilon],1] under the linear relaxation model. We compare the strategy on multiknapsack and maximum clique problems with other heuristics.

Keywords: Branch; and; bound; Heuristics; Multiknapsack; Clique (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00496-7
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:197:y:2009:i:2:p:439-445

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().