Characterizations of polygreedoids and poly-antimatroids by greedy algorithms
From MaRDI portal
Publication:2488235
DOI10.1016/j.orl.2004.07.009zbMath1070.90135MaRDI QIDQ2488235
Publication date: 25 August 2005
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2004.07.009
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
68R05: Combinatorics in computer science
68R15: Combinatorics on words
Related Items
Distributive Lattice Polyhedra, A Geometric Characterization of Poly-antimatroids, Recognition of Antimatroidal Point Sets
Cites Work