Different strategies for solving bilinear integer non-linear programming problems with convex transformations

Computers and Chemical Engineering

Volumn 21, Issue SUPPL.1, 1997, Pages

  Harjunkoski, I ^a   Porn, R ^a   Westerlund, T ^a   Skrifvars, H ^a  

^a ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041733019     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0098-1354(97)87549-7     Document Type: Article

References (4)

1. Harjunkoski I., Westerlund T., Isaksson J. and Skrifvars H. (1996). Different Formulations for Solving Trim Loss Problems in a Paper Converting Mill with ILP. Computers chem. Engng 20 Suppl. pp. S121-S126.
2. Skrifvars H., Harjunkoski I., Westerlund T., Kravanja Z. and Pörn R. (1996). Comparison of Different MINLP Methods Applied on Some Chemical Engineering Problems. Computers chem. Engng 20 Suppl., pp. S333-S338.
3. Westerlund T. and Pettersson F. (1995). An Extended Cutting Plane Method for Solving Convex MINLP Problems. Computers chem. Engng, 19, Suppl., pp. 131-136.
4. Westerlund T., Isaksson J. and Harjunkoski I. (1996). Solving a Two-Dimensional Trim-Loss Problem with MILP. European Journal of Operational Research