Fixed-charge continuous knapsack problems and pseudogreedy solutions

DOI10.1007/S101070050074MaRDI QIDQ1586210zbMATH OpenOpenAlexFDO

Authors 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 analysisgreedy solutionconvex maximizationfixed-charge continuous knapsack problemgeneralixe fixed-cost functionpseudogreedy solution

Mathematics Subject Classification ID

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

Recommendations

• Approximate and exact algorithms for the fixed-charge knapsack problem
• A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
• A nonlinear knapsack problem
• On the optimality of the greedy solutions of the general knapsack problems
• Publication:4204000

Cited in

(3)

• Maximization of generalized convex functionals in locally convex spaces.
• The continuous knapsack problem with capacities
• A heuristic algorithm for a chance constrained stochastic program

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1586210)