Sciweavers

16091 search results - page 378 / 3219
» Solving
Sort
View
SIAMJO
2008
108views more  SIAMJO 2008»
15 years 6 months ago
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
Jiawang Nie, James Demmel
SOCO
2008
Springer
15 years 6 months ago
Tabu search for attribute reduction in rough set theory
Attribute reduction of an information system is a key problem in rough set theory and its applications. Using computational intelligence (CI) tools to solve such problems has rece...
Abdel-Rahman Hedar, Jue Wang, Masao Fukushima
CCE
2005
15 years 6 months ago
Logic-based outer approximation for globally optimal synthesis of process networks
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
María Lorena Bergamini, Pío A. Aguir...
MANSCI
2007
139views more  MANSCI 2007»
15 years 6 months ago
A Market-Based Optimization Algorithm for Distributed Systems
In this paper, a market-based decomposition method for decomposable linear systems is developed. The solution process iterates between a master problem that solves the market-matc...
Zhiling Guo, Gary J. Koehler, Andrew B. Whinston
COR
2002
90views more  COR 2002»
15 years 6 months ago
Extremist vs. centrist decision behavior: quasi-convex utility functions for interactive multi-objective linear programming prob
This paper presents the fundamental theory and algorithms for identifying the most preferred alternative for a decision maker (DM) having a non-centrist (or extremist) preferentia...
Behnam Malakooti, Jumah E. Al-alwani