An algorithmic framework for convex mixed integer nonlinear programs
Top Cited Papers
- 31 May 2008
- journal article
- Published by Elsevier BV in Discrete Optimization
- Vol. 5 (2), 186-204
- https://doi.org/10.1016/j.disopt.2006.10.011
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Optimization of block layout design problems with unequal areas: A comparison of MILP and MINLP optimization methodsComputers & Chemical Engineering, 2005
- Global optimization of mixed-integer nonlinear programs: A theoretical and computational studyMathematical Programming, 2004
- Benchmarking optimization software with performance profilesMathematical Programming, 2002
- A branch-and-cut method for 0-1 mixed convex programmingMathematical Programming, 1999
- logmip: a disjunctive 0–1 non-linear optimizer for process system modelsComputers & Chemical Engineering, 1999
- Different transformations for solving non-convex trim-loss problems by MINLPEuropean Journal of Operational Research, 1998
- Logic-based MINLP algorithms for the optimal synthesis of process networksComputers & Chemical Engineering, 1996
- An extended cutting plane method for solving convex MINLP problemsComputers & Chemical Engineering, 1995
- Modelling and computational techniques for logic based integer programmingComputers & Chemical Engineering, 1994
- An LP/NLP based branch and bound algorithm for convex MINLP optimization problemsComputers & Chemical Engineering, 1992