879 search results - page 79 / 176 » A Constraint Programming Approach for the Service Consolidat... |
114
Voted
STOC
1995
ACM
15 years 7 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
123
Voted
COR
2010
15 years 3 months ago
2010
The Multi-Compartment Vehicle Routing Problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of costumers for several products that because o...
130
Voted
CDC
2010
IEEE
2010
IEEE
Convergence of discrete-time approximations of constrained linear-quadratic optimal control problems
14 years 10 months ago
Abstract-- Continuous-time linear constrained optimal control problems are in practice often solved using discretization techniques, e.g. in model predictive control (MPC). This re...
140
Voted
CCGRID
2002
IEEE
15 years 8 months ago
2002
IEEE
Despite the large research efforts in the SW–DSM community, this technology has not yet been adapted widely for significant codes beyond benchmark suites. One of the reasons co...
115
Voted
UM
2007
Springer
15 years 9 months ago
2007
Springer
Web personalization has demonstrated to be advantageous for both online customers and vendors. However, its benefits may be severely counteracted by privacy constraints. Personaliz...