A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes
type: Item
instance of: scholarly article
title: A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes
zbMATH Open document ID: 1167.90585
author: Katta G. Murty
published in: Optimization Letters
publication date: 2009-06-17T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 5565966
zbMATH Keywords: convex polytopes and their dual polytopes
zbMATH Keywords: facetal constraint functions
zbMATH Keywords: adjacency
zbMATH Keywords: segments
zbMATH Keywords: mukkas
zbMATH Keywords: nearest points
MaRDI profile type: Publication
full work available at URL: s11590-008-0103-8
OpenAlex ID: W1989485640
cites work: Facets of an assignment problem with 0-1 constraint
cites work: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
cites work: Q3844775
cites work: Q5547252
cites work: Generating all vertices of a polyhedron is hard
cites work: Adjacency on Convex Polyhedra
cites work: Segments in enumerating faces
cites work: Q3415351
cites work: Efficient enumeration of the vertices of polyhedra associated with network LP's
cites work: Q4876436
DOI: 10.1007/S11590-008-0103-8
description: scientific article; zbMATH DE number 5565966