Combining cutting-plane and branch-and-bound methods to solve integer programming problems : applications to the travelling salesman problem and the l-matching problem
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
-
On Waring's problem
by: Chowla, I.
Published: (1940) -
Three problems in the geometry of numbers
by: ApSimon, H. G.
Published: (1951) -
From the classical moment problem to the realizability problem on basic semi-algebraic sets of generalized functions
by: Rota, Aldo
Published: (2013) -
Some problems involving prime numbers
by: Welch, D. E.
Published: (2007) -
Integers expressible as sums of distinct units
by: Belcher, Paul
Published: (1975)