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
外部発表Yes

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

フィンガープリント Adjacency of the best and second best valued solutions in combinatorial optimization problems' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用