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

Yoshiko Ikebe, Tomomi Matsui, Akihisa Tamura

研究成果: Article査読

4 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)227-232
ページ数6
ジャーナルDiscrete Applied Mathematics
47
3
DOI
出版ステータスPublished - 1993 12月 21
外部発表はい

ASJC Scopus subject areas

  • 離散数学と組合せ数学
  • 応用数学

フィンガープリント

「Adjacency of the best and second best valued solutions in combinatorial optimization problems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル