Polyhedra with high-density graphs and polynomial-time solvability of combinatorial optimization problems
type: Item
instance of: scholarly article
title: Polyhedra with high-density graphs and polynomial-time solvability of combinatorial optimization problems
zbMATH Open document ID: 0801.90094
author: V. A. Bondarenko
published in: Automation and Remote Control
publication date: 1994-07-24T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 52B12
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 584226
zbMATH Keywords: polynomial-time algorithms
zbMATH Keywords: polyhedra with exponential graph density
zbMATH Keywords: systems of linear constraints
MaRDI profile type: Publication
Recommended article: Q4890614
Recommended article: On polyhedron graph density in problems of combinatorial optimization
Recommended article: Q3832321
Recommended article: Polyhedral Combinatorics in Combinatorial Optimization
Recommended article: Q3374106
Recommended article: Search problems on graphs of regular polyhedra
Recommended article: Q4316056
Recommended article: Q4242473
Recommended article: Cardinality constrained combinatorial optimization: complexity and polyhedra
description: scientific article; zbMATH DE number 584226