On the greedy solution in integer linear programming

DOI10.1007/BF01258608zbMath0631.90045OpenAlexW1999769443MaRDI QIDQ3768677

Béla Vizvári

Publication date: 1987

Published in: [https://portal.mardi4nfdi.de/entity/Q3026756 Zeitschrift f�r Operations Research] (Search for Journal in Brave)

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

zbMATH Keywords

knapsack problemsHilbert basesgreedy method

Mathematics Subject Classification ID

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

Cites Work

• When the Greedy Solution Solves a Class of Knapsack Problems
• Unnamed Item

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