Use this URL to cite or link to this record in EThOS: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.465640
Title: Combining cutting-plane and branch-and-bound methods to solve integer programming problems : applications to the travelling salesman problem and the l-matching problem
Author: Miliotis, Panayotis
Awarding Body: London School of Economics and Political Science (University of London)
Current Institution: London School of Economics and Political Science (University of London)
Date of Award: 1975
Availability of Full Text:
Access through EThOS:
Abstract:
No abstract available
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID: uk.bl.ethos.465640  DOI: Not available
Share: