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: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Elsevier,
2017-04-07T15:38:35Z.
|
| Subjects: | |
| Online Access: | Get fulltext |