The analysis of the stability of some integer programming algorithms with respect to the objective function

DOI10.3103/S1066369X11040049zbMath1229.90094MaRDI QIDQ647857

M. V. Devyaterikova, Alexander A. Kolokolov, Nikolay Kosarev

Publication date: 21 November 2011

Published in: Russian Mathematics (Search for Journal in Brave)

zbMATH Keywords

integer programmingdiscrete optimizationBenders decompositionbranch and bound method\(L\)-class enumerationstability of algorithms

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

Comparison of three approaches to studying stability of solutions to problems of discrete optimization and computational geometry ⋮ On one approach to TSP structural stability

Cites Work

• Unnamed Item
• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• On a quantitative measure of stability for a vector problem in integer programming
• Application of regular partitions in integer programming
• On the stability of some integer programming algorithms
• Stability analysis of some discrete optimization algorithms

This page was built for publication: The analysis of the stability of some integer programming algorithms with respect to the objective function