Optimization under ordinal scales: When is a greedy solution optimal?

DOI10.1007/BF01217692zbMath0889.90156MaRDI QIDQ1374691

Aleksandar Saša Pekeč

Publication date: 10 December 1997

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

zbMATH Keywords

optimizationgreedy algorithmsmeasurement theory

Mathematics Subject Classification ID

Programming in abstract spaces (90C48)

Cites Work

• Meaningfulness of conclusions from combinatorial optimization
• Effects of change of scale on optimality in a scheduling model with priorities and earliness/tardiness penalties
• The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item