Free Access

A Note on Coefficient Adjustment Using Sos Constraints

R. Lougee-Heimer
R. Lougee-Heimer
[email protected]
Mathematical Sciences, IBM T. J. Watson Research Center, Yorktown Heights, New York 10598
Search for more papers by this author

R. Lougee-Heimer

R. Lougee-Heimer

[email protected]

Mathematical Sciences, IBM T. J. Watson Research Center, Yorktown Heights, New York 10598

Search for more papers by this author

Published Online:1 Feb 2001https://doi.org/10.1287/opre.49.1.175.11184

References

Johnson E. L., Kostreva M. M., Suhl U. H. Solving 0-1 integer programming problems arising from large scale planning models. Oper. Res. (1985) 33:803–819Link, Google Scholar

cover image Operations Research

Volume 49, Issue 1

January-February 2001

Pages 1-180

Article Information

Metrics

Information

Received:November 01, 1998
Accepted:November 01, 1999
Published Online:February 01, 2001

© 2001 INFORMS

Cite as

R. Lougee-Heimer, (2001) A Note on Coefficient Adjustment Using Sos Constraints. Operations Research 49(1):175-177.

https://doi.org/10.1287/opre.49.1.175.11184

Keywords

Integer programming, theory: coefficient adjustment using special ordered sets; cutting planes; continuous relaxation