(Generalized) convexity and discrete optimization

MaRDI QIDQ4667358zbMATH OpenFDO

Authors Rainer E. Burkard

Publication date 19 April 2005

Mathematics Subject Classification ID

General convexity (52Axx) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Convex programming (90C25) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 480244
• scientific article; zbMATH DE number 3852794
• Convex discrete optimization
• scientific article; zbMATH DE number 3860890
• Integer convex minimization by mixed integer linear optimization

Cited in

(9)

• On a primal-proximal heuristic in discrete optimization
• scientific article; zbMATH DE number 3852794 (Why is no real title available?)
• scientific article; zbMATH DE number 3970527 (Why is no real title available?)
• scientific article; zbMATH DE number 4051356 (Why is no real title available?)
• scientific article; zbMATH DE number 480244 (Why is no real title available?)
• scientific article; zbMATH DE number 1159852 (Why is no real title available?)
• ALGORITHMS FOR L-CONVEX FUNCTION MINIMIZATION: CONNECTION BETWEEN DISCRETE CONVEX ANALYSIS AND OTHER RESEARCH FIELDS
• Exact optimization of discrete constrained total variation minimization problems
• Decomposition of an Integrally Convex Set into a Minkowski Sum of Bounded and Conic Integrally Convex Sets

This page was built for publication: (Generalized) convexity and discrete optimization

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