Incremental and encoding formulations for Mixed Integer Programming
The standard way to represent a choice between n alternatives in Mixed Integer Programming is through n binary variables that add up to one. Unfortunately, this approach commonly leads to unbalanced branch-and-bound trees and diminished solver performance. In this paper, we present an encoding formu...
| Main Authors: | , |
|---|---|
| Andre forfattere: | |
| Format: | Article |
| Sprog: | en_US |
| Udgivet: |
Elsevier
2017
|
| Online adgang: | http://hdl.handle.net/1721.1/107938 https://orcid.org/0000-0003-4335-7248 |