The construction of test problems in integer-value programming with binary unknowns

DOI10.1016/0041-5553(85)90048-5MaRDI QIDQ3705223zbMATH OpenOpenAlexFDO

Authors R. Dzh. Babaev

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)90048-5

zbMATH Keywords

computational experienceLagrange functiontest problem construction

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Boolean programming (90C09) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 4047443
• Construction of test problems in quadratic bivalent programming
• scientific article; zbMATH DE number 4045478
• Investigation of solutions of randomly generated integer programming problems with 0-1 variables
• scientific article; zbMATH DE number 1380414

Cited in

(5)

• Test sets for integer programs
• Test problem construction for linear bilevel programming problems
• scientific article; zbMATH DE number 4045478 (Why is no real title available?)
• scientific article; zbMATH DE number 4047443 (Why is no real title available?)
• Construction of test problems in quadratic bivalent programming

This page was built for publication: The construction of test problems in integer-value programming with binary unknowns

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