𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new global approach for 0–1 polynomial programs

✍ Scribed by Li Han-Lin

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
712 KB
Volume
21
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximate approach of global optimi
An approximate approach of global optimization for polynomial programming problems
✍ Han-Lin Li; Ching-Ter Chang 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 626 KB

Many methods for solving polynomial programming problems can only find locally optimal solutions. This paper proposes a method for finding the approximately globally optimal solutions of polynomial programs. Representing a bounded continuous variable xi as the addition of a discrete variable dj and

A cutting-plane approach to mixed 0–1 st
A cutting-plane approach to mixed 0–1 stochastic integer programs
✍ Claus C. Carøe; Jørgen Tind 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 773 KB

We consider a mixed 0-1 integer programming problem with dual block-angular structure arising in two-stage stochastic programming. A relaxation is proposed such that the problem is decomposed into subproblems each corresponding to the outcomes of the random variable. The convex hull of feasible solu

A new local–global approach for classifi
A new local–global approach for classification
✍ R.T. Peres; C.E. Pedreira 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 610 KB

In this paper, we propose a new local-global pattern classification scheme that combines supervised and unsupervised approaches, taking advantage of both, local and global environments. We understand as global methods the ones concerned with the aim of constructing a model for the whole problem spac