An estimate for the curvature of an order-convex set in the integer lattice and related questions

DOI10.1134/S000143460807016XzbMath1219.05037MaRDI QIDQ635600

A. B. Ramazanov

Publication date: 20 August 2011

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

discrete optimizationgradient algorithmcurvature of feasible setsguaranteed error estimatesupermatroid

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial aspects of matroids and geometric lattices (05B35) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (1)

On stability of the gradient algorithm in convex discrete optimisation problems and related questions

Cites Work

• Unnamed Item
• Unnamed Item
• An Analysis of the Greedy Heuristic for Independence Systems

This page was built for publication: An estimate for the curvature of an order-convex set in the integer lattice and related questions