Return to search

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

No description available.
Identiferoai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:465640
Date January 1975
CreatorsMiliotis, Panayotis
PublisherLondon School of Economics and Political Science (University of London)
Source SetsEthos UK
Detected LanguageEnglish
TypeElectronic Thesis or Dissertation

Page generated in 0.0019 seconds