A Lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures
Year of publication: |
2008
|
---|---|
Authors: | Karuppiah, Ramkumar ; Grossmann, Ignacio E. |
Published in: |
Journal of global optimization : an international journal dealing with theoretical and computational aspects of seeking global optima and their applications in science, management and engineering. - Dordrecht [u.a.] : Springer, ISSN 0925-5001, ZDB-ID 1074566x. - Vol. 41.2008, 2, p. 163-186
|
Saved in:
Saved in favorites
Similar items by person
-
Mitra, Sumit, (2013)
-
Caballero, José A., (2014)
-
A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
Ruiz, Juan P., (2012)
- More ...