Reformulation in mathematical programming: An application to quantum chemistry
- 28 March 2009
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 157 (6) , 1309-1318
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An Exact Reformulation Algorithm for Large Nonconvex NLPs Involving Bilinear TermsJournal of Global Optimization, 2006
- Linearity Embedded in Nonconvex ProgramsJournal of Global Optimization, 2005
- Application of Deterministic Low-Discrepancy Sequences in Global OptimizationComputational Optimization and Applications, 2005
- Reduction constraints for the global optimization of NLPsInternational Transactions in Operational Research, 2003
- Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood searchEuropean Journal of Operational Research, 2003
- A global optimization method, αBB, for general twice-differentiable constrained NLPs — I. Theoretical advancesComputers & Chemical Engineering, 1998
- A new reformulation-linearization technique for bilinear programming problemsJournal of Global Optimization, 1992
- Basis Sets for Ab Initio Molecular Orbital Calculations and Intermolecular Interactions1990
- Jointly Constrained Biconvex ProgrammingMathematics of Operations Research, 1983
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problemsMathematical Programming, 1976