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

DOI10.1134/S000143460807016XzbMATH Open1219.05037MaRDI QIDQ635600FDOQ635600

Authors: A. B. Ramazanov 

Publication date: 20 August 2011

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

zbMATH Keywords

gradient algorithmdiscrete optimizationcurvature 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)

Cites Work

• Title not available (Why is that?)
• An Analysis of the Greedy Heuristic for Independence Systems
• Title not available (Why is that?)

Cited In (1)

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

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

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