Fixed-charge continuous knapsack problems and pseudogreedy solutions

Mathematical Programming, Series B

Volumn 85, Issue 3, 1999, Pages 617-642

  Haberl, Josef ^a,b  

^a UNIVERSITY OF KLAGENFURT   (Austria)

^b SCAPP Front Line Systems   (Austria)

Author keywords

Convex maximization; Fixed charge continuous knapsack problem; Generalized fixed cost function; Greedy solution; Pseudogreedy solution; Sensitivity analysis

Indexed keywords

EID: 4344635154     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050074     Document Type: Article

References (11)

1. Bellman, R., Esogbue, A.P., Nabeshima, I. (1982): Mathematical Aspects of Scheduling and Sequencing. Pergamon Press, Oxford
2. Benson, H.P., Erenguc, S.S. (1988): Using convex envelopes to solve the interactive fixed-charge linear programming problem. J. Optim. Theory Appl. 59, 223-246
3. Boas, R.P. (1996): A Primer of Real Functions. The Mathematical Association of America Inc.
4. Chvátal, V. (1983): Linear Programming. W.H. Freeman and Company, N.Y.
5. Conway, R.W., Maxwell, W.L., Miller, L.W. (1967): Theory of Scheduling. Addison-Wesley, Reading, MA
6. Cooper, C. (1994): Probabilistic analysis of two k-cluster problems. Discrete Appl. Math. 50, 27-51
7. Chabrillac, Y., Crouzeix, J.-P. (1987): Continuity and differentiability properties of monotone real functions of several real variables. Math. Program. Study 30, 1-16
8. Dantzig, G.B. (1974): Discrete-variable extremum problems. Oper. Res. 5, 266-277
9. Deo, N. (1974): Graph Theory with Applications to Engineering and Computer Science. Prentice Hall, Englewood Cliffs, NJ
10. Dyer, M.E. (1984): An O(n) algorithm for the multiple-choice Knapsack linear program. Math. Program. 29, 57-63
11. Eiselt, H.A. (1986): Contínuous maximin Knapsack problems with GLB constraints. Math. Program. 36, 114-121