On the greedy solution in integer linear programming

DOI10.1007/BF01258608MaRDI QIDQ3768677zbMATH OpenOpenAlexFDO

Authors B. Vizvári

Publication date 1987

Published in Zeitschrift f�r Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

greedy methodHilbert basesknapsack problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Recommendations

• A greedy algorithm for some classes of integer programs.
• On the optimality of the greedy solutions of the general knapsack problems
• scientific article; zbMATH DE number 3950207
• scientific article; zbMATH DE number 3970528
• Greedy sets and related problems

Cites work

• scientific article; zbMATH DE number 3751684 (Why is no real title available?)
• When the Greedy Solution Solves a Class of Knapsack Problems

Cited in

(10)

• A greedy algorithm for some classes of integer programs.
• On the description of a class of integer programs resolvable by the coordinate lift algorithm
• An analysis of six greedy selection rules on a class of zero-one integer programming models
• scientific article; zbMATH DE number 3950207 (Why is no real title available?)
• On the optimality of the greedy solutions of the general knapsack problems
• scientific article; zbMATH DE number 3892933 (Why is no real title available?)
• Greedy systems of linear inequalities and lexicographically optimal solutions
• scientific article; zbMATH DE number 6460215 (Why is no real title available?)
• Linear programming and the worst-case analysis of greedy algorithms on cubic graphs
• Optimality criterion for a class of nonlinear integer programs.

This page was built for publication: On the greedy solution in integer linear programming

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