4.5 Article

Reduced RLT representations for nonconvex polynomial programming problems

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Computer Science, Software Engineering

Global optimization problems and domain reduction strategies

Alberto Caprara et al.

MATHEMATICAL PROGRAMMING (2010)

Article Computer Science, Software Engineering

Branching and bounds tightening techniques for non-convex MINLP

Pietro Belotti et al.

OPTIMIZATION METHODS & SOFTWARE (2009)

Article Operations Research & Management Science

An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms

Leo Liberti et al.

JOURNAL OF GLOBAL OPTIMIZATION (2006)

Article Operations Research & Management Science

Linearity embedded in nonconvex programs

L Liberti

JOURNAL OF GLOBAL OPTIMIZATION (2005)

Article Computer Science, Software Engineering

A polyhedral branch-and-cut approach to global optimization

M Tawarmalani et al.

MATHEMATICAL PROGRAMMING (2005)

Article Operations Research & Management Science

Enhancing RLT relaxations via a new class of semidefinite cuts

HD Sherali et al.

JOURNAL OF GLOBAL OPTIMIZATION (2002)