Two-phase greedy algorithms for some classes of combinatorial linear programs

DOI10.1145/1824777.1824785MaRDI QIDQ2930347zbMATH OpenOpenAlexFDO

Authors U. Faigle, Britta Peis

Publication date 18 November 2014

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1824777.1824785

zbMATH Keywords

latticessubmodularity

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Linear programming (90C05) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A general class of greedily solvable linear programs
• A note on Faigle and Kern's dual greedy polyhedra
• scientific article; zbMATH DE number 1263283
• scientific article; zbMATH DE number 3970528
• A greedy algorithm for some classes of integer programs.

Cited in

(3)

• A general class of greedily solvable linear programs
• scientific article; zbMATH DE number 3942929 (Why is no real title available?)
• scientific article; zbMATH DE number 1263283 (Why is no real title available?)

This page was built for publication: Two-phase greedy algorithms for some classes of combinatorial linear programs

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