Low order polynomial bounds on the expected performance of local improvement algorithms

This publication has 18 references indexed in Scilit:

• Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method
  Mathematics of Operations Research, 1982
• Observations on a class of nasty linear complementarity problems
  Discrete Applied Mathematics, 1980
• Computational complexity of LCPs associated with positive definite symmetric matrices
  Mathematical Programming, 1979
• Convex Location Problems on Tree Networks
  Operations Research, 1976
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971
• Sets of lattice points which contain a maximal number of edges
  Proceedings of the American Mathematical Society, 1971
• Efficient Heuristic Procedures for Integer Linear Programming with an Interior
  Operations Research, 1969
• Complementary pivot theory of mathematical programming
  Linear Algebra and its Applications, 1968
• Lengths of snakes in boxes
  Journal of Combinatorial Theory, 1967
• Computer Solutions of the Traveling Salesman Problem
  Bell System Technical Journal, 1965