270 search results - page 29 / 54 » Constraint relaxation in approximate linear programs |
126
click to vote
DISOPT
2008
15 years 16 days ago
2008
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
125
Voted
OL
2007
14 years 12 months ago
2007
We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which th...
104
Voted
MP
1998
15 years 3 days ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
94
Voted
IPPS
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper presents a technique for memory optimization for a class of computations that arises in the field of correlated electronic structure methods such as coupled cluster and...
104
Voted
JCO
2000
15 years 7 days ago
2000
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...