Segments in enumerating faces
dc.contributor.author | Murty, Katta G. | en_US |
dc.contributor.author | Chung, Sung-Jin | en_US |
dc.date.accessioned | 2006-09-11T19:33:48Z | |
dc.date.available | 2006-09-11T19:33:48Z | |
dc.date.issued | 1995-10 | en_US |
dc.identifier.citation | Murty, Katta G.; Chung, Sung-Jin; (1995). "Segments in enumerating faces." Mathematical Programming 70 (1-3): 27-45. <http://hdl.handle.net/2027.42/47929> | en_US |
dc.identifier.issn | 0025-5610 | en_US |
dc.identifier.issn | 1436-4646 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/47929 | |
dc.description.abstract | We introduce the concept of a segment of a degenerate convex polytope specified by a system of linear constraints, and explain its importance in developing algorithms for enumerating the faces. Using segments, we describe an algorithm that enumerates all the faces, in time polynomial in their number. The role of segments in the unsolved problem of enumerating the extreme points of a convex polytope specified by a degenerate system of linear constraints, in time polynomial in the number of extreme points, is discussed. | en_US |
dc.format.extent | 1428057 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Springer-Verlag; The Mathematical Programming Society, Inc. | en_US |
dc.subject.other | Mathematics | en_US |
dc.subject.other | Segments | en_US |
dc.subject.other | Numerical Analysis | en_US |
dc.subject.other | Mathematics of Computing | en_US |
dc.subject.other | Combinatorics | en_US |
dc.subject.other | Adjacency | en_US |
dc.subject.other | Enumeration of Faces | en_US |
dc.subject.other | Convex Polytopes | en_US |
dc.subject.other | Mathematical and Computational Physics | en_US |
dc.subject.other | Operation Research/Decision Theory | en_US |
dc.subject.other | Mathematical Methods in Physics | en_US |
dc.subject.other | Numerical and Computational Methods | en_US |
dc.subject.other | Calculus of Variations and Optimal Control | en_US |
dc.subject.other | Optimization | en_US |
dc.title | Segments in enumerating faces | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Industrial and Operations Engineering, University of Michigan, 48109-2117, Ann Arbor, MI, USA | en_US |
dc.contributor.affiliationother | Department of Industrial Engineering, Seoul National University, Seoul, South Korea | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/47929/1/10107_2005_Article_BF01585927.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/BF01585927 | en_US |
dc.identifier.source | Mathematical Programming | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.