Adjacency on combinatorial polyhedra
type: Item
instance of: scholarly article
title: Adjacency on combinatorial polyhedra
zbMATH Open document ID: 0818.90070
DOI: 10.1016/0166-218X(94)00092-R
author: Tomomi Matsui
author: Sunao Tamura
published in: Discrete Applied Mathematics
publication date: 1995-05-04T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 52B12
zbMATH DE Number: 750908
zbMATH Keywords: combinatorial polyhedra
zbMATH Keywords: set partitioning
zbMATH Keywords: set packing
zbMATH Keywords: perfect matching
zbMATH Keywords: vertex packing
MaRDI profile type: Publication
cites work: On the Set-Covering Problem
cites work: On the Set-Covering Problem: II. An Algorithm for Set Partitioning
cites work: Set Partitioning: A survey
cites work: Signature Methods for the Assignment Problem
cites work: On the Assignment Polytope
cites work: Signature classes of transportation polytopes
cites work: Algorithms for finding k-best perfect matchings
cites work: On certain polytopes associated with graphs
cites work: Paths, Trees, and Flowers
cites work: Two Algorithms for Generating Weighted Spanning Trees in Order
cites work: Q3882177
cites work: Adjacency of the best and second best valued solutions in combinatorial optimization problems
cites work: Simplex pivots on the set packing polytope
cites work: Paths on Polyhedra. I
cites work: The d-Step Conjecture and Its Relatives
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: The Hirsch conjecture is true for (0,1)-polytopes
cites work: Hamiltonicity and combinatorial polyhedra
cites work: The adjacency relation on the traveling salesman polytope is NP-Complete
cites work: The monotonic diameter of the perfect matching and shortest path polytopes
cites work: The Monotonic Bounded Hirsch Conjecture is False for Dimension at Least 4
cites work: Q5611528
description: scientific article; zbMATH DE number 750908