Sciweavers

2940 search results - page 393 / 588
» Behavioral Constraints for Services
Sort
View
IOR
2006
173views more  IOR 2006»
13 years 9 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau
JNW
2007
112views more  JNW 2007»
13 years 9 months ago
A Multi-Commodity Flow Model for Optimal Routing in Wireless MESH Networks
— We propose a mathematical programming model of the routing problem in multi-hop wireless networks that takes into account quality of service requirements considering bandwidth ...
Antonio Capone, Fabio Martignon
OR
2007
Springer
13 years 9 months ago
Hybrid heuristics for the probabilistic maximal covering location-allocation problem
The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhan...
Francisco de Assis Corrêa, Antonio Augusto C...
PPSN
2010
Springer
13 years 8 months ago
Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
Mario Ruthmair, Günther R. Raidl
SIGOPS
2010
112views more  SIGOPS 2010»
13 years 8 months ago
QoS-oriented control of server systems
Multi-tier architectures are widely used by internet applications. Guaranteeing the performance, and more generally the quality of service (QoS), of such applications remains a cr...
Luc Malrait