2647 search results - page 66 / 530 » Solving Term Inequalities |
153
click to vote
EOR
2010
15 years 4 months ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
139
click to vote
CCO
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequa...
164
click to vote
SIAMJO
2002
15 years 3 months ago
2002
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
146
click to vote
IPL
2010
15 years 2 months ago
2010
In the Max Lin-2 problem we are given a system S of m linear equations in n variables over F2 in which Equation j is assigned a positive integral weight wj for each j. We wish to ...
132
click to vote
SIGMETRICS
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we investigate the suitability of embedding Internet hosts into a Euclidean space given their pairwise distances (as measured by round-trip time). Using the classic...