Some basic exchange properties in combinatorial optimization and their application to constructing the K-best solutions

  • Dergis U
  • 4

    Readers

    Mendeley users who have this article in their library.
  • 1

    Citations

    Citations of this article.

Abstract

We characterize optimal, k-best and sets of k-best solutions for a combinatorial optimization problem via simple exchange properties. We show the relationship of this concept to the concept of adjacency and we extend the concept to discrete optimization problems and problems with objective functions fulfilling the cone-property. We show that those exchange properties play a fundamental role in partitioning strategies for finding sets of k-best solutions. © 1985 Elsevier Science Publishers B.V. (North-Holland).

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Ulrich Dergis

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free