Investigation of solutions of randomly generated integer programming problems with 0-1 variables

DOI10.1007/BF02366581MaRDI QIDQ1364109zbMATH OpenFDO

Authors V. P. Shilo, I. V. Sergienko

Publication date 24 August 1997

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

zbMATH Keywords

integer linear programming

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10)

Recommendations

• Random decomposition of 0-1 linear integer programming problems and automatic choice of algorithms
• Analysis of randomised rounding for integer programs
• Solution and investigation of one class of inexact integer programming problems
• A Facet Generation Procedure for Solving 0/1 Integer Programs
• scientific article; zbMATH DE number 4047443
• Solving linear programs with finite precision. I: Condition numbers and random programs
• Integer feasibility of random polytopes: random integer programs
• scientific article; zbMATH DE number 4087425
• A randomized algorithm for fixed-dimensional linear programming
• A simple strategy for solving a class of 0-1 integer programming models

Cites work

• scientific article; zbMATH DE number 3452922 (Why is no real title available?)
• An approach to the construction of approximate solutions of Boolean linear programming problems

Cited in

(3)

• The construction of test problems in integer-value programming with binary unknowns
• scientific article; zbMATH DE number 4083364 (Why is no real title available?)
• scientific article; zbMATH DE number 4047443 (Why is no real title available?)

This page was built for publication: Investigation of solutions of randomly generated integer programming problems with 0-1 variables

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