A New Look at a Greedy Algorithm for Solving a Class of Convex Programming Problems
Year of publication: |
1999
|
---|---|
Authors: | Chakravarti, N. |
Published in: |
INFOR : information systems and operational research. - Ottawa : INFOR Journal, ISSN 0315-5986, ZDB-ID 1212606. - Vol. 37.1999, 4, p. 353-356
|
Saved in:
Saved in favorites
Similar items by person
-
Calculation of Stability Radii for Combinatorial Optimization Problems
Chakravarti, N., (1997)
-
Some results concerning post-infeasibility analysis
Chakravarti, N., (1994)
-
LP relaxation of the two dimensional knapsack problem with box and GUB constraints
Bagchi, A., (1996)
- More ...