An algorithm for concave integer minimization over a polyhedron

[1]  Nguyen V. Thoai,et al.  Concave minimization via conical partitions and polyhedral outer approximation , 1991, Math. Program..

[2]  S. Selcuk Erenguc,et al.  Using convex envelopes to solve the interactive fixed-charge linear programming problem , 1988 .

[3]  Panos M. Pardalos,et al.  Constrained Global Optimization: Algorithms and Applications , 1987, Lecture Notes in Computer Science.

[4]  S. Selcuk Erenguc,et al.  A branch and bound algorithm for a single-item multi-source dynamic lot sizing problem with capacity constraints , 1987 .

[5]  S. S. Erenguc,et al.  The interactive fixed charge linear programming problem , 1986 .

[6]  Panos M. Pardalos,et al.  Global minimization of large-scale constrained concave quadratic problems by separable programming , 1986, Math. Program..

[7]  H. Tuy,et al.  A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set , 1985, Math. Oper. Res..

[8]  H. P. Benson,et al.  A finite algorithm for concave minimization over a polyhedron , 1985 .

[9]  H. P. Benson,et al.  Algorithms for parametric nonconvex programming , 1982 .

[10]  Clifford C. Petersen,et al.  An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions , 1979 .

[11]  Hiroshi Konno,et al.  Maximization of A convex quadratic function under linear constraints , 1976, Math. Program..

[12]  Reiner Horst,et al.  An algorithm for nonconvex programming problems , 1976, Math. Program..

[13]  James E. Falk,et al.  A Successive Underestimation Method for Concave Minimization Problems , 1976, Math. Oper. Res..

[14]  Richard M. Soland,et al.  Optimal Facility Location with Concave Costs , 1974, Oper. Res..

[15]  J. E. Falk,et al.  An Algorithm for Separable Nonconvex Programming Problems , 1969 .