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

  • Authors:

  • Ulrich Dergis

  • Affiliations:

  • -

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 1985

Quantified Score

Hi-index 0.04

Visualization

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.