383 search results - page 6 / 77 » A new infeasible interior-point algorithm for linear program... |
SIAMJO
2010
13 years 2 months ago
2010
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
IOR
2006
13 years 7 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
—The notion of p-cycle (Preconfigured Protection Cycle) allows capacity efficient schemes to be designed for fast span protection in WDM mesh networks. Conventional p-cycle const...
APPML
2007
13 years 7 months ago
2007
We present a new strategy for choosing primal and dual steplengths in a primal-dual interior-point algorithm for convex quadratic programming. Current implementations often scale ...
FCT
2007
Springer
14 years 1 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...