Symmetry in combinatorial optimization
Integer optimization is in the class of NP-hard problems, and it is very time and memory intensive to find optimal solutions. In this thesis an algorithm will be developed to improve the efficiency in solving a linear integer program if there are symmetries in the problem, that is, variables can be...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
2002
|
| Online Access: | http://spectrum.library.concordia.ca/1753/1/MQ72888.pdf Loeschner, Kristina <http://spectrum.library.concordia.ca/view/creators/Loeschner=3AKristina=3A=3A.html> (2002) Symmetry in combinatorial optimization. Masters thesis, Concordia University. |