Concave Programming Applied to a Special Class of 0-1 Integer Programs

DOI10.1287/opre.21.1.135zbMath0265.90033OpenAlexW1970291468MaRDI QIDQ5681810

Fred Glover, Darwin D. Klingman

Publication date: 1973

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.21.1.135

Mathematics Subject Classification ID

Convex programming (90C25) Integer programming (90C10)

Related Items (10)

A branch and bound algorithm for extreme point mathematical programming problems ⋮ Reverse convex programming ⋮ Membership functions, some mathematical programming models and production scheduling ⋮ On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope ⋮ An interior point algorithm to solve computationally difficult set covering problems ⋮ An extreme-point-ranking algorithm for the extreme-point mathematical programming problem ⋮ A converse for disjunctive constraints ⋮ Convergence of a subgradient method for computing the bound norm of matrices ⋮ On the global minimization of concave functions ⋮ A penalty function approach for solving bi-level linear programs

This page was built for publication: Concave Programming Applied to a Special Class of 0-1 Integer Programs