Results 1 
3 of
3
On the Solution of Traveling Salesman Problems
 DOC. MATH. J. DMV
, 1998
"... Following the theoretical studies of J.B. Robinson and H.W. Kuhn in the late 1940s and the early 1950s, G.B. Dantzig, R. Fulkerson, and S.M. Johnson demonstrated in 1954 that large instances of the TSP could be solved by linear programming. Their approach remains the only known tool for solving TS ..."
Abstract

Cited by 206 (7 self)
 Add to MetaCart
Following the theoretical studies of J.B. Robinson and H.W. Kuhn in the late 1940s and the early 1950s, G.B. Dantzig, R. Fulkerson, and S.M. Johnson demonstrated in 1954 that large instances of the TSP could be solved by linear programming. Their approach remains the only known tool for solving TSP instances with more than several hundred cities; over the years, it has evolved further through the work of M. Grötschel , S. Hong , M. Jünger , P. Miliotis , D. Naddef , M. Padberg
On the History of Combinatorial Optimization (till 1960)
"... As a coherent mathematical discipline, combinatorial optimization is relatively young. When studying the history of the field, one observes a number of independent lines of research, separately considering problems like optimum assignment, shortest spanning tree, transportation, and the traveling ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
(Show Context)
As a coherent mathematical discipline, combinatorial optimization is relatively young. When studying the history of the field, one observes a number of independent lines of research, separately considering problems like optimum assignment, shortest spanning tree, transportation, and the traveling salesman problem. Only in the 1950's, when the unifying tool of linear and integer programming became available and the area of operations research got intensive attention, these problems were put into one framework, and relations between them were laid. Indeed, linear programming forms the hinge in the history of combinatorial optimization. Its initial conception by Kantorovich and Koopmans was motivated by combinatorial applications, in particular in transportation and transshipment. After the formulation of linear programming as generic problem, and the development in 1947 by Dantzig of the simplex method as a tool, one has tried to attack about all combinatorial opti
USE OF A NONLINEAR MODEL FOR IMPROVED ESTIMATION IN CLUSTER SAMPLING
"... Several researchers have attempted to develop a general law to predict a general relationship between variance within cluster S and size of the cluster M for purposes like 2 w determination of optimum cluster size etc. In the present study a nonlinear model has been S and M which has shown improvem ..."
Abstract
 Add to MetaCart
(Show Context)
Several researchers have attempted to develop a general law to predict a general relationship between variance within cluster S and size of the cluster M for purposes like 2 w determination of optimum cluster size etc. In the present study a nonlinear model has been S and M which has shown improvement suggested for describing the relationship between 2 w over existing models and results have also been verified with the help of an example.