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.
| Original language | English |
|---|---|
| Pages (from-to) | 265-271 |
| Number of pages | 7 |
| Journal | Operations Research Letters |
| Volume | 40 |
| Issue number | 4 |
| DOIs | |
| State | Published - Jul 2012 |
| Externally published | Yes |
Keywords
- Heuristic
- Local branching
- Mixed integer programming
- Variable depth search
Fingerprint
Dive into the research topics of 'A variable depth search branching'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver