Meaningfulness of conclusions from combinatorial optimization

Research output: Contribution to journalArticle

15 Scopus citations

Abstract

This paper summarizes the theory of meaningful statements from the literature of measurement theory and applies the concept of meaningfulness to combinatorial optimization. A variety of statements of the type usually made in combinatorial optimization are analyzed with regard to their meaningfulness and further directions of analysis are indicated. The analysis is applied to such problems as shortest path, maximum weighted acyclic subgraph, minimum spanning tree, utility maximization, and maximization of average performance.

Original languageEnglish (US)
Pages (from-to)221-241
Number of pages21
JournalDiscrete Applied Mathematics
Volume29
Issue number2-3
DOIs
StatePublished - Jan 1 1990

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Applied Mathematics
  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Fingerprint Dive into the research topics of 'Meaningfulness of conclusions from combinatorial optimization'. Together they form a unique fingerprint.

  • Cite this