4894 search results - page 523 / 979 » The Guarding Problem - Complexity and Approximation |
156
click to vote
SIAMSC
2008
15 years 4 months ago
2008
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
123
click to vote
TWC
2008
15 years 4 months ago
2008
The study of the class of new spatial multiplexing architectures (SMAs) is continued. As introduced in Part I of this paper, the SMAs consist of joint design of rate and power all...
164
click to vote
SIAMJO
2000
15 years 4 months ago
2000
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
127
click to vote
JAIR
1998
15 years 4 months ago
1998
This article studies the problem of modifying the action ordering of a plan in order to optimise the plan according to various criteria. One of these criteria is to make a plan le...
138
click to vote
JCO
1998
15 years 4 months ago
1998
Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlyingnetwork could be ...