View Item 

Show simple item record

Segments in enumerating faces
dc.contributor.authorMurty, Katta G.en_US
dc.contributor.authorChung, Sung-Jinen_US
dc.date.accessioned2006-09-11T19:33:48Z
dc.date.available2006-09-11T19:33:48Z
dc.date.issued1995-10en_US
dc.identifier.citationMurty, 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.issn0025-5610en_US
dc.identifier.issn1436-4646en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/47929
dc.description.abstractWe 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.extent1428057 bytes
dc.format.extent3115 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherSpringer-Verlag; The Mathematical Programming Society, Inc.en_US
dc.subject.otherMathematicsen_US
dc.subject.otherSegmentsen_US
dc.subject.otherNumerical Analysisen_US
dc.subject.otherMathematics of Computingen_US
dc.subject.otherCombinatoricsen_US
dc.subject.otherAdjacencyen_US
dc.subject.otherEnumeration of Facesen_US
dc.subject.otherConvex Polytopesen_US
dc.subject.otherMathematical and Computational Physicsen_US
dc.subject.otherOperation Research/Decision Theoryen_US
dc.subject.otherMathematical Methods in Physicsen_US
dc.subject.otherNumerical and Computational Methodsen_US
dc.subject.otherCalculus of Variations and Optimal Controlen_US
dc.subject.otherOptimizationen_US
dc.titleSegments in enumerating facesen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Industrial and Operations Engineering, University of Michigan, 48109-2117, Ann Arbor, MI, USAen_US
dc.contributor.affiliationotherDepartment of Industrial Engineering, Seoul National University, Seoul, South Koreaen_US
dc.contributor.affiliationumcampusAnn Arboren_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/47929/1/10107_2005_Article_BF01585927.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1007/BF01585927en_US
dc.identifier.sourceMathematical Programmingen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
10107_2005_Article_BF01585927.pdf
Size:
1.361MB
Format:
PDF
View/Open

Show simple item record

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.