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

Fingerprint

Combinatorial optimization
Adjacency
Polytopes
Combinatorial Optimization Problem
Polytope
Extreme Points
Set Packing
Set Partitioning
Perfect Matching
Adjacent
Binary
Sufficient Conditions

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Applied Mathematics
  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Adjacency of the best and second best valued solutions in combinatorial optimization problems. / Ikebe, Yoshiko; Matsui, Tomomi; Tamura, Akihisa.

In: Discrete Applied Mathematics, Vol. 47, No. 3, 21.12.1993, p. 227-232.

Research output: Contribution to journalArticle

@article{3a03db45560b42d1b09caa1baf812245,
title = "Adjacency of the best and second best valued solutions in combinatorial optimization problems",
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.",
author = "Yoshiko Ikebe and Tomomi Matsui and Akihisa Tamura",
year = "1993",
month = "12",
day = "21",
doi = "10.1016/0166-218X(93)90128-B",
language = "English",
volume = "47",
pages = "227--232",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

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

AU - Ikebe, Yoshiko

AU - Matsui, Tomomi

AU - Tamura, Akihisa

PY - 1993/12/21

Y1 - 1993/12/21

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=43949162474&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=43949162474&partnerID=8YFLogxK

U2 - 10.1016/0166-218X(93)90128-B

DO - 10.1016/0166-218X(93)90128-B

M3 - Article

AN - SCOPUS:43949162474

VL - 47

SP - 227

EP - 232

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 3

ER -