Sciweavers

350 search results - page 28 / 70
» Separation of Partition Inequalities
Sort
View
HICSS
2009
IEEE
106views Biometrics» more  HICSS 2009»
14 years 3 months ago
Transmission Tariffs by Use of System and Economic Benefits
Setting electric transmission tariffs is a classical multi-objective problem. The tariff problem is particularly challenging in modern power markets where transmission has been se...
Daniel J. Cámac, Raúl C. Bastidas, W...
IWPEC
2009
Springer
14 years 3 months ago
The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
Panos Giannopoulos, Christian Knauer, Günter ...
IPCO
2008
221views Optimization» more  IPCO 2008»
13 years 10 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
CORR
2006
Springer
97views Education» more  CORR 2006»
13 years 9 months ago
The one-way communication complexity of the Boolean Hidden Matching Problem
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...
Iordanis Kerenidis, Ran Raz
GECCO
2005
Springer
125views Optimization» more  GECCO 2005»
14 years 2 months ago
Schema disruption in tree-structured chromosomes
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
William A. Greene