A guide to simulation (2nd ed.)
A guide to simulation (2nd ed.)
Mathematical Programming: Series A and B
Integer and combinatorial optimization
Integer and combinatorial optimization
Expressing combinatorial optimization problems by linear programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Operations that preserve total dual integrality
Operations Research Letters
Valid inequalities and separation for uncapacitated fixed charge networks
Operations Research Letters
Node packings on cocomparability graphs
Operations Research Letters
Compact vs. exponential-size LP relaxations
Operations Research Letters
Extended formulations, nonnegative factorizations, and randomized communication protocols
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
An information complexity approach to extended formulations
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Characterization of facets of the hop constrained chain polytope via dynamic programming
Discrete Applied Mathematics
| Hi-index | 0.00 |
The linear relaxation of mixed integer programming models can be strengthened by introducing auxiliary variables. We develop a new method for generating auxiliary variable reformulations for problems where the separation algorithm for finding violated cuts can be formulated as a linear program. Our results have important consequences for integrality proofs and efficient formulations.