Adjacency of the best and second best valued solutions in combinatorial optimization problems

Yoshiko Ikebe, Tomomi Matsui, Akihisa Tamura

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

We say that a polytope satisfies the strong adjacency property if every best valued extreme point of the polytope is adjacent to some second best valued extreme point for any weight vector. Perfect matching polytopes satisfy this property. In this paper, we give sufficient conditions for a polytope to satisfy the strong adjacency property. From this, binary b-matching polytopes, set partitioning polytopes, set packing polytopes, etc. satisfy the strong adjacency property.

Original languageEnglish
Pages (from-to)227-232
Number of pages6
JournalDiscrete Applied Mathematics
Volume47
Issue number3
DOIs
Publication statusPublished - 1993 Dec 21
Externally publishedYes

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Adjacency of the best and second best valued solutions in combinatorial optimization problems'. Together they form a unique fingerprint.

  • Cite this