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

DOI10.1287/OPRE.21.1.135MaRDI QIDQ5681810zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(10)

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

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

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