Computational algorithms for finding the radius of stability in problems of choice

DOI10.1016/S0041-5553(83)80141-4MaRDI QIDQ3682231zbMATH OpenOpenAlexFDO

Authors V. K. Leont'ev, I. Kh. Sigal, Eh. N. Gordeev

Publication date 1983

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0041-5553(83)80141-4

zbMATH Keywords

algorithmsassignmentcombinatorial optimizationradius of stabilitytravelling salesman

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 3858850
• scientific article; zbMATH DE number 4106610
• Calculation of stability radii for combinatorial optimization problems
• scientific article; zbMATH DE number 4100959
• Publication:3204334
• scientific article; zbMATH DE number 4149904
• The stability radius of an efficient solution in minimax Boolean programming problem
• Publication:4206576
• scientific article; zbMATH DE number 1489999
• scientific article; zbMATH DE number 3968297

Cited in

(3)

• Stability analysis for a special interval cutting problem
• Some concepts of stability analysis in combinatorial optimization
• Prudent k-choice functions: Properties and algorithms

This page was built for publication: Computational algorithms for finding the radius of stability in problems of choice

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