On accuracy of solutions for discrete optimization problems with perturbed coefficients of the objective function
From MaRDI portal
Publication:1290128
DOI10.1023/A:1018991826728zbMath0918.90121OpenAlexW286879630MaRDI QIDQ1290128
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
Related Items (8)
Stability and accuracy functions in multicriteria linear combinatorial optimization problems ⋮ Stability analysis of efficient portfolios in a discrete variant of multicriteria investment problem with Savage's risk criteria ⋮ Optimal makespan scheduling with given bounds of processing times ⋮ Stability and accuracy functions for a multicriteria Boolean linear programming problem with parameterized principle of optimality ``from Condorcet to Pareto ⋮ Balancing of simple assembly lines under variations of task processing times ⋮ Stability analysis of the Pareto optimal solutions for some vector boolean optimization problem ⋮ Stability and accuracy functions in a coalition game with bans, linear payoffs and antagonistic strategies ⋮ A note on robustness tolerances for combinatorial optimization problems
This page was built for publication: On accuracy of solutions for discrete optimization problems with perturbed coefficients of the objective function
