Optimal Design of Truss Structures by Logic-Based Branch and Cut

References

• Balas E. A note on duality in disjunctive programming. J. Optim. Theory Appl. (1977) 21:523–527Crossref, Google Scholar
• Balas E. Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Discrete Math. (1985) 6:466–486Crossref, Google Scholar
• Barth P.Logic-Based 0-1 Constraint Programming (1995) (Kluwer Academic Publishers, Boston, MA) Google Scholar
• Beaumont N. An algorithm for disjunctive programs. Eur. J. Oper. Res. (1990) 48:362–371Crossref, Google Scholar
• Bremicker M., Papalambros P. Y., Loh H. T. Solution of mixed-discrete structural optimization problems with a new sequential linearization algorithm. Comput. Structures (1990) 37:451–461Crossref, Google Scholar
• Cai J., Thierauf G. Discrete optimization of structures using an improved penalty function method. Eng. Optim. (1993) 21:293–306Crossref, Google Scholar
• Cai J., Thierauf G. Discrete structural optimization using parallel sub-evolution-strategy. AIAA Sympos. Multidisciplinary Anal. Optim. (1994) (Panama City, FL)1239–1246Crossref, Google Scholar
• Colmerauer A., Kanouia H., Pasero R., Roussel P. Un système de communication homme-machine en français. (1973) . technical report, Université d'Aix-Marseilles II, Groupe intelligence artificielleGoogle Scholar
• Dincbas M., Van Hentenryck P., Simonis H., Aggoun A., Graf T., Bertier F. The constraint programming language CHIP. Proc. Internat. Conf. Fifth Generation Comput. Systems FGCS-88 (1988) TokyoGoogle Scholar
• Ghattas O., Grossmann I. MINLP and MILP strategies for discrete sizing structural optimization problems. Proc. ASCE 10th Conf. Electronic. Comput. (1991) IndianapolisGoogle Scholar
• Granot F., Hammer P. L. On the use of boolean functions in 0-1 linear programming. Methods Oper. Res. (1971) 154–184Google Scholar
• Grossmann I., Voudouris V. T., Ghattas O., Floudas C. A., Pardalos P. M. Mixed-integer linear programming formulations of some nonlinear discrete design optimization problems. Recent Advances in Global Optimization (1992) (Princeton University Press)Google Scholar
• Hammer P. L., Rudeanu S.Boolean Methods in Operations Research and Related Areas (1968) (Springer Verlag, Berlin, NY) Crossref, Google Scholar
• Hammer P. L. Generalized resolution and cutting planes. Ann. Oper. Res. (1988a) 12:217–239Crossref, Google Scholar
• Hammer P. L. A quantitative approach to logical inference. Decision Support Systems (1988b) 4:45–69Crossref, Google Scholar
• Hooker J. N. Resolution vs. cutting plane solution of inference problems: Some computational experience. Oper. Res. Lett. (1988c) 7:1–7Crossref, Google Scholar
• Hooker J. N. Input proofs and rank one cutting planes. ORSA J. Comput. (1989) 1:137–145Link, Google Scholar
• Hooker J. N. Generalized resolution for 0-1 linear inequalities. Ann. Math. and AI (1992) 6:271–286Google Scholar
• Hooker J. N., Borning A. Logic-based methods for optimization. Principles and Practice of Constraint Programming, Lecture Notes in Computer Science (1994) 874:336–349Crossref, Google Scholar
• Hooker J. N., Osorio M. A. Mixed logical/linear programming. Discrete Appl. Math. (1999) 96–97:395–442Crossref, Google Scholar
• Hooker J. N., Yan H., Grossmann I., Raman R. Logic cuts for processing networks with fixed charges. Comput. and Oper. Res. (1994) 21:265–279Crossref, Google Scholar
• Jaffer J., Lassez J.-L. From unification to constraints. Logic programming 87, Proceedings of the 6th Conference (1987) (Springer)1–18Google Scholar
• Jeroslow R. E. Representability in mixed integer programming I: Characterization results. Discrete Appl. Math. (1987) 17:223–243Crossref, Google Scholar
• Jeroslow R. E. Logic-Based Decision Support: Mixed Integer Model Formulation. Ann. Discrete Math. (1989) 40(North-Holland, Amsterdam) Google Scholar
• Jeroslow R. E., Lowe J. K. Modeling with integer variables. Math. Programming Studies (1984) 22:167–184Crossref, Google Scholar
• Kowalski R. A. Predicate logic as programming language. Proc. IFIP Congress (1974) (North-Holland, Amsterdam) 569–574Google Scholar
• McAloon K., Tretkoff C.Optimization and Computational Logic (1997) (Wiley)Google Scholar
• Marriott K., Stuckey P. J.Programming with Constraints: An Introduction (1998) (MIT Press, Cambridge, MA) Crossref, Google Scholar
• Puget J.-F. A C++ implementation of CLP. (1994) . Technical report 94-01. ILOG S.A., Gentilly, FranceGoogle Scholar
• Raman R., Grossman I. E. Relation between MILP modeling and logical inference for chemical process synthesis. Comput. Chemical Engrg. (1991) 15:73–84Crossref, Google Scholar
• Raman R., Grossman I. E. Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks. Ann. Oper. Res. (1993a) 42:169–191Crossref, Google Scholar
• Raman R., Grossman I. E. Symbolic integration of logic in mixed-integer linear programming techniques for process synthesis. Comput. Chemical Engrg. (1993b) 17:909–927Crossref, Google Scholar
• Raman R., Grossman I. E. Modeling and computational techniques for logic based integer programming. Comput. Chemical Engrg. (1994) 18:563–578Crossref, Google Scholar
• Sheu C. Y., Schmit L. A. Minimum weight design of elastic redundant trusses under multiple static loading conditions. AIAA J. (1972) 10:155–162Crossref, Google Scholar
• Simonis H., Dincbas M., Benhamou F., Colmerauer A. Propositional calculus problems in CHIP. Constraint Logic Programming: Selected Research (1993) (MIT Press, Cambridge, MA) 269–285Google Scholar
• Strang G. Introduction to Applied Mathematics. (1986) (Wellesley-Cambridge Press)Google Scholar
• Tsang E.Foundations of Constraint Satisfaction (1993) (Academic Press, London) Google Scholar
• Turkay M., Grossmann I. E. Logic-basd MINLP algorithms for the optimal synthesis of process networks. Comput. Chemical Engrg. (1996) 20:959–978Crossref, Google Scholar
• Utku S., Norris C. H., Wilbur J. B. McGraw Hill, Elementary Structural Analysis. (1991) 4th ed.(McGraw Hill)Google Scholar
• Van Hentenryck P.Constraint Satisfaction in Logic Programming (1988) (MIT Press, Cambridge, MA) Google Scholar
• Venkayya V. B. Design of Optimum Structures. Comput. Structures (1971) 1:265–309Crossref, Google Scholar
• Williams H. P. Fourier-Motzkin elimination extension to integer programming problems. J. Combinatorial Theory (1976) 21:118–123Crossref, Google Scholar
• Williams H. P. Logical problems and integer programming. Bull. Inst. Math. and Implications (1977) 13:18–20Google Scholar
• Williams H. P. Linear and integer programming applied to the propositional calculus. Internat. J. Systems Res. Inform. Sci. (1987) 2:81–100Google Scholar
• Williams H. P. Logic applied to integer programming and integer programming applied to logic. Eur. J. Oper. Res. (1995) 81:605–616Crossref, Google Scholar