Integral Convex Polyhedra and an Approach to Integralization
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 objecti...
| Main Author: | |
|---|---|
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/149392 |