Enumerative techniques for solving some nonconvex global optimization problems

This publication has 23 references indexed in Scilit:

• An implicit enumeration procedure for the general linear complementarity problem
  Published by Springer Nature ,1987
• Nonlinear cost network models in transportation analysis
  Published by Springer Nature ,1986
• The Complexity of Vertex Enumeration Methods
  Mathematics of Operations Research, 1983
• On the application of parallel architectures to a class of operations research problems
  Rairo-Operations Research, 1983
• A versatile scheme for ranking the extreme points of an assignment polytope
  Naval Research Logistics Quarterly, 1981
• An algorithm for the min concave cost flow problem
  European Journal of Operational Research, 1980
• Decomposed enumeration of extreme points in the linear programming problem
  BIT Numerical Mathematics, 1975
• Generating All the Faces of a Polyhedron
  SIAM Journal on Applied Mathematics, 1974
• Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
  Operations Research, 1970
• An Algorithm for Finding All Vertices of Convex Polyhedral Sets
  Journal of the Society for Industrial and Applied Mathematics, 1961