First Page | Document Content | |
---|---|---|
Date: 2012-07-25 10:25:04Operations research Combinatorial optimization Travelling salesman problem Branch and bound Linear programming relaxation Integer programming Branch and cut Linear programming Algorithm Mathematical optimization Cutting-plane method Simplex algorithm | 227 Documenta Math. Markowitz and Manne + Eastman + Land and Doig = Branch and BoundAdd to Reading ListSource URL: documenta.sagemath.orgDownload Document from Source WebsiteFile Size: 629,99 KBShare Document on Facebook |