검색결과 : 8건
| No. | Article |
|---|---|
| 1 |
MINLP formulations for solving strip packing problems in LCD mother glass production Park KT, Kim H, Lee S, Lee HK, Ryu JH, Lee IB Computers & Chemical Engineering, 48, 312, 2013 |
| 2 |
Enterprise optimization for solving an assignment and trim-loss non-convex problem Rodriguez MA, Vecchietti A Computers & Chemical Engineering, 32(11), 2812, 2008 |
| 3 |
Two-dimensional stock cutting and rectangle packing: binary tree model representation for local search optimization methods Vassiliadis VS Journal of Food Engineering, 70(3), 257, 2005 |
| 4 |
폭 변화를 고려한 제지 공정의 최적 생산 계획 수립 김동훈, 정연수, 여영구, 문일 HWAHAK KONGHAK, 40(5), 535, 2002 |
| 5 |
Scheduling of cutting-stock processes on multiple parallel machines Giannelos NF, Georgiadis MC Chemical Engineering Research & Design, 79(7), 747, 2001 |
| 6 |
Convexification of different classes of non-convex MINLP problems Porn R, Harjunkoski I, Westerlund T Computers & Chemical Engineering, 23(3), 439, 1999 |
| 7 |
Numerical and environmental, considerations on a complex industrial mixed integer non-linear programming (MINLP) problem Harjunkoski I, Westerlund T, Porn R Computers & Chemical Engineering, 23(10), 1545, 1999 |
| 8 |
Exploring the convex transformations for solving non-convex bilinear integer problems Harjunkoski I, Porn R, Westerlund T Computers & Chemical Engineering, 23(S), S471, 1999 |