879 search results - page 55 / 176 » A Constraint Programming Approach for the Service Consolidat... |
101
Voted
HEURISTICS
2002
15 years 10 days ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
ECOOP
1994
Springer
15 years 4 months ago
1994
Springer
Product configuration management is presented as a practical application for a prototype-based object model. Data model requirements for a configuration system are first introduced...
79
Voted
MP
2007
15 years 2 days ago
2007
We present a practical approach to Anstreicher and Lee’s masked spectral bound for maximum-entropy sampling, and we describe favorable results that we have obtained with a Branch...
134
Voted
COCOS
2003
Springer
15 years 5 months ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
118
Voted
IPCO
2010
14 years 10 months ago
2010
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...