Dominance certificates for combinatorial optimization problems

Daniel Berend, Steven S. Skiena, Yochai Twitto

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review


Heuristic algorithms, such as simulated annealing, are widely used in practice to solve combinatorial optimization problems. However, they offer no guarantees regarding the quality of the provided solution. An f(I) combinatorial dominance guarantee is a certificate that a solution is not worse than at least f(I) solutions for a particular problem instance I. In this paper, we introduce simple but general techniques for awarding combinatorial dominance certificates to arbitrary solutions of various optimization problems. We demonstrate these techniques by applying them to the Traveling Salesman and Maximum Satisfiability problems, and briefly experiment their usability.

Original languageEnglish
Title of host publicationSpringer Optimization and Its Applications
PublisherSpringer International Publishing
Number of pages16
StatePublished - 1 Jan 2018

Publication series

NameSpringer Optimization and Its Applications
ISSN (Print)1931-6828
ISSN (Electronic)1931-6836

ASJC Scopus subject areas

  • Control and Optimization


Dive into the research topics of 'Dominance certificates for combinatorial optimization problems'. Together they form a unique fingerprint.

Cite this