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

DOI10.3103/S1066369X11040049zbMATH Open1229.90094MaRDI QIDQ647857FDOQ647857

Authors: M. V. Devyaterikova, A. A. Kolokolov, Nikolay Kosarev 

Publication date: 21 November 2011

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

Recommendations

• Stability analysis of some discrete optimization algorithms
• scientific article; zbMATH DE number 1859294
• Stability, parametric, and postoptimality analysis of discrete optimization problems
• scientific article; zbMATH DE number 29658
• Stability of vector problems of integer optimization: relationship with the stability of sets of optimal and nonoptimal solutions

zbMATH Keywords

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

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• 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
• Title not available (Why is that?)
• Stability analysis for \(L\)-partitions in a finite-dimensional space

Cited In (3)

• Approximating the stability region for binary mixed-integer programs
• Comparison of three approaches to studying stability of solutions to problems of discrete optimization and computational geometry
• On one approach to TSP structural stability

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

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