A variable depth search branching

descriptionPublicationkeyboard_double_arrow_right Article 01 Jul 2012 English Publisher:Elsevier BVJournal:Operations Research Letters, volume 40, pages 265-271 (issn: 0167-6377,

Copyright policy )

Authors: Fabien Cornillier; José Eduardo Pécora Junior; Vincent Charles;

doi: 10.1016/j.orl.2012.03.003 , 10.5281/zenodo.811462 , 10.5281/zenodo.811461

A variable depth search branching

- Summary
- Subjects
- Metrics

Abstract

We introduce a variable depth search branching, an extension to the local branching for solving Mixed-Integer Programs. Two strategies are assessed, a best improvement strategy and a first improvement strategy. The extensive computational assessment evidences a significant improvement over the local branching for both strategies. This record was migrated from the OpenDepot repository service in June, 2017 before shutting down.

Related Organizations

Keywords

variable depth search, Mixed integer programming, Polyhedral combinatorics, branch-and-bound, branch-and-cut, heuristic, local branching, Approximation methods and heuristics in mathematical programming, mixed integer programming

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average