Sciweavers

1816 search results - page 148 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
MP
2006
119views more  MP 2006»
15 years 6 months ago
Approximate extended formulations
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
Mathieu Van Vyve, Laurence A. Wolsey
AUTOMATICA
2005
86views more  AUTOMATICA 2005»
15 years 6 months ago
Sensitivity shaping with degree constraint by nonlinear least-squares optimization
This paper presents a new approach to shaping of the frequency response of the sensitivity function. In this approach, a desired frequency response is assumed to be specified at a...
Ryozo Nagamune, Anders Blomqvist
CDC
2010
IEEE
15 years 1 months ago
A "joint+marginal" algorithm for polynomial optimization
Abstract-- We present a new algorithm for solving a polynomial program P based on the recent "joint + marginal" approach of the first author for parametric polynomial opt...
Jean B. Lasserre, Tung Phan Thanh
CSB
2004
IEEE
109views Bioinformatics» more  CSB 2004»
15 years 10 months ago
Rec-I-DCM3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...
Usman Roshan, Bernard M. E. Moret, Tandy Warnow, T...
PRICAI
2004
Springer
15 years 11 months ago
A Multi-strategy Approach for Catalog Integration
When we have a large amount of information, we usually use categories with a hierarchy, in which all information is assigned. This paper proposes a new method of integrating two ca...
Ryutaro Ichise, Masahiro Hamasaki, Hideaki Takeda