Random decomposition of 0-1 linear integer programming problems and automatic choice of algorithms

DOI10.1007/BF02366431zbMath0838.90085MaRDI QIDQ1905136

V. P. Shilo, Ivan V. Sergienko

Publication date: 8 January 1996

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

linear integer programmingprobabilistic decomposition

Mathematics Subject Classification ID

Integer programming (90C10) Boolean programming (90C09)

Related Items (3)

Some directions and results of research in mathematical programming and system analysis ⋮ Main directions in the development of informatics ⋮ Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday)

Cites Work

• An approach to the construction of approximate solutions of Boolean linear programming problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Random decomposition of 0-1 linear integer programming problems and automatic choice of algorithms