Ant colony optimization algorithms (ACOs) have been basically introduced to discrete variable problems and applied to different research domains in several engineering fields. Meanwhile, abundant studies have been already involved to adapt different ant models to continuous search spaces. Assessments indicate competitive performance of ACOs on discrete or continuous domains. Therefore, as poten...

The number of qubits used by a quantum algorithm will be a crucial computational resource for the foreseeable future. We show how to obtain the classical query complexity for continuous problems. We then establish a simple formula for a lower bound on the qubit complexity in terms of the classical query complexity.

We study continuous partitioning problems on tree network spaces whose edges and nodes are points in Euclidean spaces. A continuous partition of this space into p connected components is a collection of p subtrees, such that no pair of them intersect at more than one point, and their union is the tree space. An edge-partition is a continuous partition de3ned by selecting p − 1 cut points along ...

Many problems in science and engineering are formulated using continuous mathematical models. Usually they can only be solved numerically and therefore approximately. Since they are often difficult to solve on a classical computer it’s interesting to investigate whether they can be solved faster on a quantum computer. After a brief introduction to quantum algorithms we report on a wide range of...

We analyze the complexity of verifying whether a given element is close to a solution element. Closeness is measured by two nonnegative parameters, " and. If = 0, then we get the strong veriication problem which usually cannot be solved in the worst case setting, see Wo zniakowski 90]. For > 0, we have the relaxed veriication problem which is studied in this paper in the worst case setting. We ...

In this paper we consider an extension of the multiarmed bandit problem. In this generalized setting, the decision maker receives some side information, performs an action chosen from a finite set and then receives a reward. Unlike in the standard bandit settings, performing an action takes a random period of time. The environment is assumed to be stationary, stochastic and memoryless. The goal...

This paper introduces a general modeling framework for multi-type maximal covering location problem in which the position of facilities different normed spaces are simultaneously decided to maximize demand generated by set points. From need intertwining decisions discrete and continuous sets, hybridized is considered some types be located finite sets others spaces. A natural non-linear model pr...