Sciweavers

147 search results - page 14 / 30
» The Uncapacitated Swapping Problem
Sort
View
SWAP
2008
13 years 11 months ago
Ontological Reasoning and Abductive Logic Programming for Service Discovery and Contracting
Abstract. The Service Oriented Architecture paradigm, and its implementation based on Web Services, have been the object of an intense research and standardization activity. One of...
Federico Chesani, Paola Mello, Marco Montali, Paol...
GECCO
2010
Springer
156views Optimization» more  GECCO 2010»
14 years 1 months ago
Elementary landscape decomposition of the quadratic assignment problem
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...
J. Francisco Chicano, Gabriel Luque, Enrique Alba
COR
2010
152views more  COR 2010»
13 years 10 months ago
Variable neighborhood search for the dial-a-ride problem
In dial-a-ride problems passengers have to be transported between pre-specified pickup and delivery locations under user inconvenience considerations. The problem variant consider...
Sophie N. Parragh, Karl F. Doerner, Richard F. Har...
JAIR
2006
92views more  JAIR 2006»
13 years 9 months ago
Dynamic Local Search for the Maximum Clique Problem
In this paper, we introduce DLS-MC, a new stochastic local search algorithm for the maximum clique problem. DLS-MC alternates between phases of iterative improvement, during which...
Wayne J. Pullan, Holger H. Hoos
TALG
2010
123views more  TALG 2010»
13 years 8 months ago
Lower-bounded facility location
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...
Zoya Svitkina