1723 search results - page 189 / 345 » Cycling in linear programming problems |
ESA
2000
Springer
15 years 1 months ago
2000
Springer
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
108
click to vote
CCCG
2009
14 years 11 months ago
2009
Clarkson's algorithm is a two-staged randomized algorithm for solving linear programs, but it can also be applied to the more general LP-type problems which comprise a number...
MIG
2010
Springer
14 years 8 months ago
2010
Springer
In computer games, one or more groups of units need to move from one location to another as quickly as possible. If there is only one group, then it can be solved efficiently as a ...
TASE
2010
IEEE
14 years 4 months ago
2010
IEEE
Robots operating in a workspace can localize themselves by querying nodes of a sensor-network deployed in the same workspace. This paper addresses the problem of computing the min...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...