umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
The Theory of Set Tolerances
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
Department of Industrial and Systems Engineering, Center for Applied Optimization, University of Florida, Unites States.
Department of Industrial and Systems Engineering, Center for Applied Optimization, University of Florida, United States.
2014 (English)In: LION 2014: Learning and Intelligent Optimization: Conference Proceedings, 2014, p. 362-377Conference paper, Published paper (Refereed)
Abstract [en]

The theory of single upper and lower tolerances for combinatorial minimization problems has been formalized in 2005 for the three types of cost functions sum, product and maximum, and since then shown to be rather useful in creating heuristics and exact algorithms for the Traveling Salesman Problem and related problems. In this paper for these three types of cost functions we extend this theory from single to set tolerances and the related reverse set tolerances. In particular, we characterize specific values of (reverse) set upper and lower tolerances as positive and infinite, and we present a criterion for the uniqueness of an optimal solution to a combinatorial minimization problem. Furthermore, we present formulas or bounds for computing (reverse) set upper and lower tolerances using the relation to their corresponding single tolerance counterparts. Finally, we give formulas for the minimum and maximum (reverse) set upper and lower tolerances using again their corresponding single tolerance counterparts.

Place, publisher, year, edition, pages
2014. p. 362-377
Series
Lectures Notes in Computer Science ; 8426
National Category
Discrete Mathematics
Identifiers
URN: urn:nbn:se:umu:diva-100114DOI: 10.1007/978-3-319-09584-4_31ISBN: 978-3-319-09583-7 (print)ISBN: 978-3-319-09584-4 (electronic)OAI: oai:DiVA.org:umu-100114DiVA, id: diva2:790222
Conference
8th Conference on Learning and Intelligent Optimization (LION 2014), Gainesville, Florida, February 16-21, 2014
Available from: 2015-02-23 Created: 2015-02-23 Last updated: 2019-06-26Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Jäger, Gerold

Search in DiVA

By author/editor
Jäger, Gerold
By organisation
Department of Mathematics and Mathematical Statistics
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 124 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf