On the Greedy Solution of Ordering Problems
From MaRDI portal
Publication:4018158
DOI10.1287/ijoc.1.3.181zbMath0753.90052OpenAlexW2066408761MaRDI QIDQ4018158
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
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (4)
Interleaving solving and elicitation of constraint satisfaction problems based on expected cost ⋮ Randomized priority algorithms ⋮ Greedy solutions of selection and ordering problems ⋮ Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem
This page was built for publication: On the Greedy Solution of Ordering Problems
