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:	512.7
Online Access:	http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.465640

id	ndltd-bl.uk-oai-ethos.bl.uk-465640
record_format	oai_dc
spelling	ndltd-bl.uk-oai-ethos.bl.uk-4656402017-06-27T03:31:20ZCombining cutting-plane and branch-and-bound methods to solve integer programming problems : applications to the travelling salesman problem and the l-matching problemMiliotis, Panayotis1975512.7London School of Economics and Political Science (University of London)http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.465640Electronic Thesis or Dissertation
collection	NDLTD
sources	NDLTD
topic	512.7
spellingShingle	512.7 Miliotis, Panayotis 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
author_facet	Miliotis, Panayotis
author_sort	Miliotis, Panayotis
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
title_short	Combining cutting-plane and branch-and-bound methods to solve integer programming problems : applications to the travelling salesman problem and the l-matching problem
title_full	Combining cutting-plane and branch-and-bound methods to solve integer programming problems : applications to the travelling salesman problem and the l-matching problem
title_fullStr	Combining cutting-plane and branch-and-bound methods to solve integer programming problems : applications to the travelling salesman problem and the l-matching problem
title_full_unstemmed	Combining cutting-plane and branch-and-bound methods to solve integer programming problems : applications to the travelling salesman problem and the l-matching problem
title_sort	combining cutting-plane and branch-and-bound methods to solve integer programming problems : applications to the travelling salesman problem and the l-matching problem
publisher	London School of Economics and Political Science (University of London)
publishDate	1975
url	http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.465640
work_keys_str_mv	AT miliotispanayotis combiningcuttingplaneandbranchandboundmethodstosolveintegerprogrammingproblemsapplicationstothetravellingsalesmanproblemandthelmatchingproblem
_version_	1718466063172108288

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

Similar Items