Compact vs. exponential-size LP relaxations

Publisher Website

1 February 2002

journal article
research article
Published by Elsevier in Operations Research Letters

Vol. 30 (1) , 57-65
https://doi.org/10.1016/s0167-6377(01)00106-7

Abstract

No abstract available

Keywords

This publication has 6 references indexed in Scilit:

Expressing combinatorial optimization problems by Linear Programs
Published by Elsevier ,2003
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
SIAM Journal on Computing, 2000
A Polyhedral Approach to RNA Sequence Structure Alignment
Journal of Computational Biology, 1998
Using separation algorithms to generate mixed integer model reformulations
Operations Research Letters, 1991
The ellipsoid method and its consequences in combinatorial optimization
Combinatorica, 1981
Optimum Communication Spanning Trees
SIAM Journal on Computing, 1974