Meaningfulness of conclusions from combinatorial optimization

DOI10.1016/0166-218X(90)90146-4zbMath0713.90067MaRDI QIDQ750310

Fred S. Roberts

Publication date: 1990

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

shortest pathmeaningfulnessminimum spanning treeaverage performancemaximum weighted acyclic subgraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Utility theory (91B16) Measurement theory in the social and behavioral sciences (91C05)

Related Items

Measurement issues in the evaluation of projects in a project portfolio, Effects of change of scale on optimality in a scheduling model with priorities and earliness/tardiness penalties, Optimization under ordinal scales: When is a greedy solution optimal?, Some thoughts on combinatorial optimisation, Meaningful and Meaningless Statements in Landscape Ecology and Environmental Sustainability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Merging relative scores
• Determining merged relative scores
• Scales and meaningfulness of quantitative laws
• On scientific laws without dimensional constants
• Applications of the theory of meaningfulness to psychology
• Scale type, meaningfulness, and the possible psychophysical laws
• On the possible merging functions
• On the theory of uniqueness in measurement
• On the Theory of Scales of Measurement
• Semiorders and a Theory of Utility Discrimination
• Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
• Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Approximative Algorithms for Discrete Optimization Problems
• Measurement Theory