An integer polyhedron related to the design of survivable communication networks.
The linear programming cutting plane method has proven to be quite successful for solving certain "hard" combinatorial optimization problems, c.f. (1), (6), (12), (24), (26). A great deal of this success is due to the use of problem specific cutting planes which define facets of the underl...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
University of Ottawa (Canada)
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10393/7818 http://dx.doi.org/10.20381/ruor-15519 |