Integral Convex Polyhedra and an Approach to Integralization
Name
MIT-LCS-TR-074.pdf
Size
3.2 MB
Format
Adobe PDF
Checksum (MD5)
98a964da6b783266f229403388a6acf1
Author(s)
Edelberg, Murray
Date Issued
August 1970
Series/Report no.
MIT-LCS-TR-074
MAC-TR-074
Abstract
Many combinatorial optimization problems may be formulated as integer linear programming problems - that is, problems of the form: given a convex polyhedron P contained in the non-negative orthant of n-dimensional space, find a integer point in P which maximizes (or minimizes) a given linear objective function. Well known linear programming methods would suffice to solve such a problem if: (i) P is an integral convex polyhedron, or (ii) P is transformed into the integral convex polyhedron that is the convex hull of the set of integer points in P, a process which is called integralization.
Persistent DSpace Link
