1984 search results - page 83 / 397 » The colourful feasibility problem |
PARA
2004
Springer
14 years 3 months ago
2004
Springer
It is known that in general, statistical analysis of interval data is an NP-hard problem: even computing the variance of interval data is, in general, NP-hard. Until now, only one ...
CP
2008
Springer
13 years 12 months ago
2008
Springer
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
CEC
2010
IEEE
13 years 11 months ago
2010
IEEE
This paper presents an adaptation of a novel algorithm based on the foraging behavior of honey bees to solve constrained numerical optimization problems. The modifications focus on...
OL
2010
13 years 8 months ago
2010
In an important paper, Burer [2] recently showed how to reformulate general mixed-binary quadratic optimization problems (QPs) into copositive programs where a linear functional i...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...