Fixed-charge continuous knapsack problems and pseudogreedy solutions

DOI10.1007/s101070050074zbMath0980.90075OpenAlexW1986758782MaRDI QIDQ1586210

Josef Haberl

Publication date: 12 November 2000

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070050074

zbMATH Keywords

sensitivity analysisconvex maximizationgreedy solutionfixed-charge continuous knapsack problemgeneralixe fixed-cost functionpseudogreedy solution

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (2)

A heuristic algorithm for a chance constrained stochastic program ⋮ Maximization of generalized convex functionals in locally convex spaces.

This page was built for publication: Fixed-charge continuous knapsack problems and pseudogreedy solutions