Branch-and-cut for symmetrical ILPs and combinatorial designs
Many combinatorial problems can be formulated as a 0-1 integer linear program (0-1 ILP), which consists of an objective function subject to linear constraints over 0-1 variables. A method called branch-and-cut has been successfully used to attack ILPs, but ILPs are still difficult to solve in practi...
Main Author: | |
---|---|
Format: | Others |
Language: | en |
Published: |
University of Ottawa (Canada)
2013
|
Subjects: | |
Online Access: | http://hdl.handle.net/10393/26749 http://dx.doi.org/10.20381/ruor-18351 |