An algorithm for concave integer minimization over a polyhedron

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199008)37:4<515::AID-NAV3220370406>3.0.CO;2-X" /><515::AID-NAV3220370406>3.0.CO;2-X 10.1002/1520-6750(199008)37:4<515::AID-NAV3220370406>3.0.CO;2-XzbMath0714.90072OpenAlexW2090765654MaRDI QIDQ3200886

S. Selcuk Erenguc, Harold P. Benson

Publication date: 1990

Full work available at URL: https://doi.org/10.1002/1520-6750(199008)37:4<515::aid-nav3220370406>3.0.co;2-x

zbMATH Keywords

branch-and-boundglobally optimal solutionpolyhedral domain

Mathematics Subject Classification ID

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

Related Items (6)

A new exact algorithm for concave knapsack problems with integer variables ⋮ 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 ⋮ A general purpose exact solution method for mixed integer concave minimization problems ⋮ Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method ⋮ Exact algorithm for concave knapsack problems: linear underestimation and partition method

Cites Work

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

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