Local algorithms for block-tree problems of discrete programming

DOI10.1016/0041-5553(85)90154-5MaRDI QIDQ3743107zbMATH OpenOpenAlexFDO

Authors Oleg A. Shcherbina

Publication date 1985

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(85)90154-5

zbMATH Keywords

treeinteger linear programminglocal algorithmblock-tree-like matrix structure

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27) Decomposition methods (49M27) Boolean programming (90C09)

Cited in

(3)

• scientific article; zbMATH DE number 5158614 (Why is no real title available?)
• Local search algorithms for the \(k\)-cardinality tree problem.
• Polynomial-time local-improvement algorithm for consecutive block minimization

This page was built for publication: Local algorithms for block-tree problems of discrete programming

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