An algorithm for concave integer minimization over a polyhedron

DOI10.1002/1520-6750(199008)37:4%3C515::AID-NAV3220370406%3E3.0.CO;2-XMaRDI QIDQ3200886zbMATH OpenOpenAlexFDO

Authors Harold P. Benson, S. Selcuk Erenguc

Publication date 1990

Full work available at URL https://doi.org/10.1002/1520-6750(199008)37:4%3C515::aid-nav3220370406%3E3.0.co;2-x

zbMATH Keywords

branch-and-boundglobally optimal solutionpolyhedral domain

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Numerical mathematical programming methods (65K05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10) Convex programming (90C25)

Recommendations

• An algorithm and new penalties for concave integer minimization over a polyhedron
• A finite algorithm for concave minimization over a polyhedron
• Normal conical algorithm for concave minimization over polytopes
• scientific article; zbMATH DE number 4127006
• Concave minimization via conical partitions and polyhedral outer approximation

Cites work

• An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions
• Concave minimization via conical partitions and polyhedral outer approximation
• Constrained global optimization: algorithms and applications
• Using convex envelopes to solve the interactive fixed-charge linear programming problem

Cited in

(21)

• A new algorithm for the minimal-area convex enclosure problem
• Normal conical algorithm for concave minimization over polytopes
• A finite concave minimization algorithm using branch and bound and neighbor generation
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
• An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane
• A general algorithm for determining all essential solutions and inequalities for any convex polyhedron
• A method for convex black-box integer global optimization
• A note on adapting methods for continuous global optimization to the discrete case
• scientific article; zbMATH DE number 3902395 (Why is no real title available?)
• A finite algorithm for concave minimization over a polyhedron
• scientific article; zbMATH DE number 4099035 (Why is no real title available?)
• scientific article; zbMATH DE number 4127006 (Why is no real title available?)
• An algorithm and new penalties for concave integer minimization over a polyhedron
• A new exact algorithm for concave knapsack problems with integer variables
• Minimizing Piecewise-Concave Functions Over Polyhedra
• A general purpose exact solution method for mixed integer concave minimization problems
• A polynomial oracle-time algorithm for convex integer minimization
• A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes
• Exact algorithm for concave knapsack problems: linear underestimation and partition method
• A simplicial algorithm for concave minimization and its performance as a heuristic tool
• Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method

This page was built for publication: An algorithm for concave integer minimization over a polyhedron

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3200886)