On the optimality of the greedy solutions of the general knapsack problems

DOI10.1080/02331939208843752zbMath0817.90072OpenAlexW2086408527MaRDI QIDQ4327882

Béla Vizvári

Publication date: 20 April 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/26139

zbMATH Keywords

knapsack problemgreedy methodinternal-point algorithmouter-point method

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (2)

A heuristic algorithm for a chance constrained stochastic program ⋮ An application of an optimal behaviour of the greedy solution in number theory

Cites Work

• When the Greedy Solution Solves a Class of Knapsack Problems

This page was built for publication: On the optimality of the greedy solutions of the general knapsack problems