An algorithm for concave integer minimization over a polyhedron-Reference-Cited by-同舟云学术

An algorithm for concave integer minimization over a polyhedron

Published:1990-08 Issue:4 Volume:37 Page:515-525
ISSN:0894-069X
Container-title:Naval Research Logistics
language:en
Short-container-title:Naval Research Logistics

Author:

Benson Harold P.,Erenguc S. Selcuk

Publisher

Wiley

Subject

Management Science and Operations Research,Ocean Engineering,Modeling and Simulation

Reference19 articles.

1. and , “Mixed-Integer Bilinear Programming Problems,” Working Paper, Department of Industrial Engineering and Operations Research, Virginia Polytechnic Institute and State University, Blacksburg, 1983.

2. Algorithms for parametric nonconvex programming

3. A finite algorithm for concave minimization over a polyhedron

4. Using convex envelopes to solve the interactive fixed-charge linear programming problem

5. The interactive fixed charge linear programming problem

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A general purpose exact solution method for mixed integer concave minimization problems;European Journal of Operational Research;2023-09

2. A Discussion on Non-Convex Optimization Problems Arising in Supply Chain Design and Finance;Advancement in Business Analytics Tools for Higher Financial Performance;2023-08-08

3. Exact Optimal Solution to Nonseparable Concave Quadratic Integer Programming Problems;Modeling and Optimization: Theory and Applications;2019

4. A new exact algorithm for concave knapsack problems with integer variables;International Journal of Computer Mathematics;2018-01-25

5. Non-convex mixed-integer nonlinear programming: A survey;Surveys in Operations Research and Management Science;2012-07