Combining cutting-plane and branch-and-bound methods to solve integer programming problems : applications to the travelling salesman problem and the l-matching problem

Bibliographic Details
Main Author: Miliotis, Panayotis
Published: London School of Economics and Political Science (University of London) 1975
Subjects:
Online Access:http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.465640

Similar Items