On accuracy of solutions for discrete optimization problems with perturbed coefficients of the objective function

DOI10.1023/A:1018991826728MaRDI QIDQ1290128zbMATH OpenOpenAlexFDO

Authors Marek Libura

Publication date 10 June 1999

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1018991826728

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• On the accuracy function and the accuracy radius for combinatorial optimization problems
• scientific article; zbMATH DE number 1852192
• scientific article; zbMATH DE number 969937

Cited in

(10)

• A note on robustness tolerances for combinatorial optimization problems
• Balancing of simple assembly lines under variations of task processing times
• Stability and accuracy functions for a multicriteria Boolean linear programming problem with parameterized principle of optimality ``from Condorcet to Pareto
• scientific article; zbMATH DE number 1852192 (Why is no real title available?)
• Stability analysis of efficient portfolios in a discrete variant of multicriteria investment problem with Savage's risk criteria
• Analysis of discrete optimization algorithms using incomplete information
• Stability analysis of the Pareto optimal solutions for some vector boolean optimization problem
• Optimal makespan scheduling with given bounds of processing times
• Stability and accuracy functions in a coalition game with bans, linear payoffs and antagonistic strategies
• Stability and accuracy functions in multicriteria linear combinatorial optimization problems

This page was built for publication: On accuracy of solutions for discrete optimization problems with perturbed coefficients of the objective function

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