3221 search results - page 334 / 645 » Termination of Linear Programs |
142
click to vote
AAAI
2000
15 years 8 months ago
2000
Both the Artificial Intelligence (AI) community and the Operations Research (OR) community are interested in developing techniques for solving hard combinatorial problems. OR has ...
161
click to vote
FOCM
2007
15 years 6 months ago
2007
A general scheme for trust-region methods on Riemannian manifolds is proposed and analyzed. Among the various approaches available to (approximately) solve the trust-region subpro...
132
click to vote
AMAI
2002
Springer
15 years 6 months ago
2002
Springer
The technique of watching two literals per clause to determine when a clause becomes a unit clause was introduced recently in the Chaff satisfiability program. That program does n...
207
click to vote
MOR
2000
15 years 6 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
187
click to vote
SIAMJO
2000
15 years 6 months ago
2000
Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successi...