Concave minimization over a convex polyhedron

This publication has 8 references indexed in Scilit:

• Convexity Cuts and Cut Search
  Operations Research, 1973
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
  Operations Research, 1971
• The fixed charge problem
  Naval Research Logistics Quarterly, 1970
• Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
  Operations Research, 1970
• On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
  Operations Research, 1969
• Solving the Fixed Charge Problem by Ranking the Extreme Points
  Operations Research, 1968
• Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
  Management Science, 1966
• The Quadratic Assignment Problem
  Management Science, 1963