On the Greedy Solution of Ordering Problems

DOI10.1287/ijoc.1.3.181zbMath0753.90052MaRDI QIDQ4018158

Avi Dechter, Rina Dechter

Publication date: 16 January 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1.3.181

zbMATH Keywords

greedy algorithm

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C27: Combinatorial optimization

05B35: Combinatorial aspects of matroids and geometric lattices

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Greedy solutions of selection and ordering problems, Interleaving solving and elicitation of constraint satisfaction problems based on expected cost, Randomized priority algorithms