메뉴 건너뛰기




Volumn 24, Issue 8, 2000, Pages 1859-1864

Combinatorial foundation for logical formulation in process network synthesis

Author keywords

Combinatorial axioms; Logical formulation; Process network synthesis

Indexed keywords

ALGORITHMS; CHEMICAL OPERATIONS; FORMAL LOGIC; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; SYNTHESIS (CHEMICAL);

EID: 0034284389     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0098-1354(00)00569-X     Document Type: Article
Times cited : (26)

References (12)
  • 7
    • 0001748821 scopus 로고    scopus 로고
    • Combinatorially accelerated branch-and-bound method for solving the MILP model of process network synthesis
    • C. A. Floudas, and P. M. Pardalos, Nonconvex optimization and its applications. Norwell, MA: Kluwer
    • (1996) , pp. 609-626
    • Friedler, F.1    Varga, J.B.2    Feher, E.3    Fan, L.T.4
  • 9
    • 0008263802 scopus 로고
    • Logical inference in branch and bound techniques for process synthesis, Proceedings of PSE 1991. Montebello, Canada
    • (1991)
    • Raman, R.1    Grossmann, I.E.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.