Ideal polytopes and face structures of some combinatorial optimization problems
type: Item
instance of: scholarly article
title: Ideal polytopes and face structures of some combinatorial optimization problems
zbMATH Open document ID: 0855.90107
DOI: 10.1007/BF01592241
author: Yoshiko T. Ikebe
author: Akihisa Tamura
published in: Mathematical Programming. Series A. Series B
publication date: 1997-01-12T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 52B12
zbMATH DE Number: 934381
zbMATH Keywords: maximum stable set problem
zbMATH Keywords: set packing
zbMATH Keywords: set partitioning
zbMATH Keywords: vertex coloring
zbMATH Keywords: heuristic
MaRDI profile type: Publication
cites work: Q5687248
cites work: Set Partitioning: A survey
cites work: On certain polytopes associated with graphs
cites work: Q4198056
cites work: Solution of large-scale symmetric travelling salesman problems
cites work: Q3882177
cites work: Q3858023
cites work: Adjacency on combinatorial polyhedra
cites work: Q4040221
cites work: The travelling salesman problem and a class of polyhedra of diameter two
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
cites work: Maximal Closure of a Graph and Applications to Combinatorial Problems
cites work: Adjacency of the Traveling Salesman Tours and $0 - 1$ Vertices
cites work: Q3818127
full work available at URL: https://doi.org/10.1007/bf01592241
OpenAlex ID: W2044332237
description: scientific article; zbMATH DE number 934381