Date of Original Version

6-1995

Type

Article

Abstract or Description

We address the problem of finding a "tight" representation of complex logical constraints in a mixed integer programming model by describing a convex hull representation of cardinality rules.

DOI

10.1007/s101070050061

Share

COinS
 

Published In

Mathematical Programming , 85, 363-377.