An algorithm and new penalties for concave integer minimization over a polyhedron

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199404)41:3<435::AID-NAV3220410309>3.0.CO;2-6" /><435::AID-NAV3220410309>3.0.CO;2-6 10.1002/1520-6750(199404)41:3<435::AID-NAV3220410309>3.0.CO;2-6zbMath0830.90106OpenAlexW2043806437MaRDI QIDQ4287998

A. Victor Cabot, Kurt M. Bretthauer, Munirpallam A. Venkataramanan

Publication date: 19 April 1994

Full work available at URL: https://doi.org/10.1002/1520-6750(199404)41:3<435::aid-nav3220410309>3.0.co;2-6

zbMATH Keywords

Lagrangian relaxationbranch-and-boundpenalty functions

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (7)

A new exact algorithm for concave knapsack problems with integer variables ⋮ A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron ⋮ A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables ⋮ 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 ⋮ Nonlinear programming for multiperiod capacity planning in a manufacturing system ⋮ Exact algorithm for concave knapsack problems: linear underestimation and partition method

Cites Work

• Using convex envelopes to solve the interactive fixed-charge linear programming problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

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