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

DOI10.1007/BF02366431zbMATH Open0838.90085MaRDI QIDQ1905136FDOQ1905136

Authors: V. P. Shilo, I. 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• An approach to the construction of approximate solutions of Boolean linear programming problems
• Title not available (Why is that?)

Cited In (4)

• Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday)
• Main directions in the development of informatics
• Some directions and results of research in mathematical programming and system analysis
• Investigation of solutions of randomly generated integer programming problems with 0-1 variables

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

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