2109 search results - page 13 / 422 » Solving Necklace Constraint Problems |
106
click to vote
CP
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a fea...
111
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
A sequential quadratic programming (SQP) method is proposed to solve the distributed beamforming problem in multiple relay networks. The problem is formulated as the minimization ...
ENDM
2010
14 years 9 months ago
2010
The Eulerian closed walk problem in a digraph is a well-known polynomial-time solvable problem. In this paper, we show that if we impose the feasible solutions to fulfill some pre...
172
click to vote
CP
2009
Springer
16 years 11 days ago
2009
Springer
Abstract. We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capaci...
104
click to vote
SIAMMAX
2010
14 years 6 months ago
2010
Optimality systems and their linearizations arising in optimal control of partial differential equations with pointwise control and (regularized) state constraints are considered. ...