400 search results - page 18 / 80 » Extended formulations in combinatorial optimization |
114
click to vote
CORR
2010
Springer
14 years 6 months ago
2010
Springer
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We consider two new formulations for classification problems in the spirit of support vector machines based on robust optimization. Our formulations are designed to build in prote...
ICCS
2003
Springer
15 years 5 months ago
2003
Springer
Issues of network reliability are very important in modern computer networks. Even a short failure of a network link can cause substantial consequences. In this paper we concentrat...
ICDE
2007
IEEE
15 years 6 months ago
2007
IEEE
Existing index selection tools rely on heuristics to efficiently search within the large space of alternative solutions and to minimize the overhead of using the query optimizer ...
109
click to vote
AAAI
2006
15 years 1 months ago
2006
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...